%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP147-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 : n007.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.14s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP147-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.09/0.36 % Computer : n007.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:00:35 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.14/0.37 % Drodi V4.1.1
% 0.14/0.40 % Refutation found
% 0.14/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.40 % SZS output start CNFRefutation for theBenchmark
% 0.14/0.40 fof(f4,axiom,(
% 0.14/0.40 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f5,axiom,(
% 0.14/0.40 (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f7,axiom,(
% 0.14/0.40 (![X,Y,Z]: (least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f10,axiom,(
% 0.14/0.40 (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f11,axiom,(
% 0.14/0.40 (![X,Y]: (greatest_lower_bound(X,least_upper_bound(X,Y)) = X ))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f16,hypothesis,(
% 0.14/0.40 greatest_lower_bound(a,c) = a ),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f17,hypothesis,(
% 0.14/0.40 greatest_lower_bound(b,c) = b ),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f18,negated_conjecture,(
% 0.14/0.40 greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b) ),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f22,plain,(
% 0.14/0.40 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.14/0.40 inference(cnf_transformation,[status(thm)],[f4])).
% 0.14/0.40 fof(f23,plain,(
% 0.14/0.40 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.14/0.40 inference(cnf_transformation,[status(thm)],[f5])).
% 0.14/0.40 fof(f25,plain,(
% 0.14/0.40 ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(least_upper_bound(X0,X1),X2))),
% 0.14/0.40 inference(cnf_transformation,[status(thm)],[f7])).
% 0.14/0.40 fof(f28,plain,(
% 0.14/0.40 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.14/0.40 inference(cnf_transformation,[status(thm)],[f10])).
% 0.14/0.40 fof(f29,plain,(
% 0.14/0.40 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X0,X1))=X0)),
% 0.14/0.40 inference(cnf_transformation,[status(thm)],[f11])).
% 0.14/0.40 fof(f34,plain,(
% 0.14/0.40 greatest_lower_bound(a,c)=a),
% 0.14/0.40 inference(cnf_transformation,[status(thm)],[f16])).
% 0.14/0.40 fof(f35,plain,(
% 0.14/0.40 greatest_lower_bound(b,c)=b),
% 0.14/0.40 inference(cnf_transformation,[status(thm)],[f17])).
% 0.14/0.40 fof(f36,plain,(
% 0.14/0.40 ~greatest_lower_bound(least_upper_bound(a,b),c)=least_upper_bound(a,b)),
% 0.14/0.40 inference(cnf_transformation,[status(thm)],[f18])).
% 0.14/0.40 fof(f37,definition,(
% 0.14/0.40 sF1_fnc=least_upper_bound(a,b)),
% 0.14/0.40 introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.14/0.40 fof(f38,definition,(
% 0.14/0.40 sF0_fnc=greatest_lower_bound(sF1_fnc,c)),
% 0.14/0.40 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.14/0.40 fof(f39,plain,(
% 0.14/0.40 ~sF0_fnc=sF1_fnc),
% 0.14/0.40 inference(definition_folding,[],[f36,f38,f37])).
% 0.14/0.40 fof(f40,plain,(
% 0.14/0.40 greatest_lower_bound(c,a)=a),
% 0.14/0.40 inference(forward_demodulation,[status(thm)],[f22,f34])).
% 0.14/0.40 fof(f41,plain,(
% 0.14/0.40 greatest_lower_bound(c,b)=b),
% 0.14/0.40 inference(forward_demodulation,[status(thm)],[f22,f35])).
% 0.14/0.40 fof(f42,plain,(
% 0.14/0.40 sF0_fnc=greatest_lower_bound(c,sF1_fnc)),
% 0.14/0.40 inference(forward_demodulation,[status(thm)],[f22,f38])).
% 0.14/0.40 fof(f47,plain,(
% 0.14/0.40 least_upper_bound(c,b)=c),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f41,f28])).
% 0.14/0.40 fof(f48,plain,(
% 0.14/0.40 least_upper_bound(c,a)=c),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f40,f28])).
% 0.14/0.40 fof(f84,plain,(
% 0.14/0.40 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X1,X0))=X0)),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f23,f29])).
% 0.14/0.40 fof(f116,plain,(
% 0.14/0.40 ![X0]: (least_upper_bound(c,least_upper_bound(a,X0))=least_upper_bound(c,X0))),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f48,f25])).
% 0.14/0.40 fof(f2006,plain,(
% 0.14/0.40 least_upper_bound(c,sF1_fnc)=least_upper_bound(c,b)),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f37,f116])).
% 0.14/0.40 fof(f2030,plain,(
% 0.14/0.40 least_upper_bound(c,sF1_fnc)=c),
% 0.14/0.40 inference(forward_demodulation,[status(thm)],[f47,f2006])).
% 0.14/0.40 fof(f2057,plain,(
% 0.14/0.40 greatest_lower_bound(sF1_fnc,c)=sF1_fnc),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f2030,f84])).
% 0.14/0.40 fof(f2067,plain,(
% 0.14/0.40 greatest_lower_bound(c,sF1_fnc)=sF1_fnc),
% 0.14/0.40 inference(forward_demodulation,[status(thm)],[f22,f2057])).
% 0.14/0.40 fof(f2068,plain,(
% 0.14/0.40 sF0_fnc=sF1_fnc),
% 0.14/0.40 inference(forward_demodulation,[status(thm)],[f42,f2067])).
% 0.14/0.40 fof(f2069,plain,(
% 0.14/0.40 $false),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f2068,f39])).
% 0.14/0.40 % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.41 % Elapsed time: 0.044065 seconds
% 0.14/0.41 % CPU time: 0.207435 seconds
% 0.14/0.41 % Total memory used: 7.339 MB
% 0.14/0.41 % Net memory used: 7.268 MB
%------------------------------------------------------------------------------