%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP141-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 : n012.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.03s 0.30s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP141-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.02 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Sun Sep 20 20:02:07 UTC 2026
% 0.03/0.29 % CPUTime :
% 0.03/0.30 % Drodi V4.1.1
% 0.03/0.30 % Refutation found
% 0.03/0.30 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.03/0.30 % SZS output start CNFRefutation for theBenchmark
% 0.03/0.30 fof(f4,axiom,(
% 0.03/0.30 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.03/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.03/0.30 fof(f5,axiom,(
% 0.03/0.30 (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.03/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.03/0.30 fof(f6,axiom,(
% 0.03/0.30 (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 0.03/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.03/0.30 fof(f11,axiom,(
% 0.03/0.30 (![X,Y]: (greatest_lower_bound(X,least_upper_bound(X,Y)) = X ))),
% 0.03/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.03/0.30 fof(f16,hypothesis,(
% 0.03/0.30 least_upper_bound(a,c) = a ),
% 0.03/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.03/0.30 fof(f17,hypothesis,(
% 0.03/0.30 least_upper_bound(b,c) = b ),
% 0.03/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.03/0.30 fof(f18,negated_conjecture,(
% 0.03/0.30 greatest_lower_bound(greatest_lower_bound(a,b),c) != c ),
% 0.03/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.03/0.30 fof(f22,plain,(
% 0.03/0.30 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.03/0.30 inference(cnf_transformation,[status(thm)],[f4])).
% 0.03/0.30 fof(f23,plain,(
% 0.03/0.30 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.03/0.30 inference(cnf_transformation,[status(thm)],[f5])).
% 0.03/0.30 fof(f24,plain,(
% 0.03/0.30 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.03/0.30 inference(cnf_transformation,[status(thm)],[f6])).
% 0.03/0.30 fof(f29,plain,(
% 0.03/0.30 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X0,X1))=X0)),
% 0.03/0.30 inference(cnf_transformation,[status(thm)],[f11])).
% 0.03/0.30 fof(f34,plain,(
% 0.03/0.30 least_upper_bound(a,c)=a),
% 0.03/0.30 inference(cnf_transformation,[status(thm)],[f16])).
% 0.03/0.30 fof(f35,plain,(
% 0.03/0.30 least_upper_bound(b,c)=b),
% 0.03/0.30 inference(cnf_transformation,[status(thm)],[f17])).
% 0.03/0.30 fof(f36,plain,(
% 0.03/0.30 ~greatest_lower_bound(greatest_lower_bound(a,b),c)=c),
% 0.03/0.30 inference(cnf_transformation,[status(thm)],[f18])).
% 0.03/0.31 fof(f40,plain,(
% 0.03/0.31 ~greatest_lower_bound(a,greatest_lower_bound(b,c))=c),
% 0.03/0.31 inference(forward_demodulation,[status(thm)],[f24,f36])).
% 0.03/0.31 fof(f209,plain,(
% 0.03/0.31 a=least_upper_bound(c,a)),
% 0.03/0.31 inference(paramodulation,[status(thm)],[f34,f23])).
% 0.03/0.31 fof(f217,plain,(
% 0.03/0.31 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X1,X0))=X0)),
% 0.03/0.31 inference(paramodulation,[status(thm)],[f23,f29])).
% 0.03/0.31 fof(f223,plain,(
% 0.03/0.31 greatest_lower_bound(c,a)=c),
% 0.03/0.31 inference(paramodulation,[status(thm)],[f209,f29])).
% 0.03/0.31 fof(f228,plain,(
% 0.03/0.31 greatest_lower_bound(c,b)=c),
% 0.03/0.31 inference(paramodulation,[status(thm)],[f35,f217])).
% 0.03/0.31 fof(f259,plain,(
% 0.03/0.31 greatest_lower_bound(b,c)=c),
% 0.03/0.31 inference(paramodulation,[status(thm)],[f22,f228])).
% 0.03/0.31 fof(f269,plain,(
% 0.03/0.31 ~greatest_lower_bound(a,c)=c),
% 0.03/0.31 inference(backward_demodulation,[status(thm)],[f259,f40])).
% 0.03/0.31 fof(f278,plain,(
% 0.03/0.31 ~greatest_lower_bound(c,a)=c),
% 0.03/0.31 inference(paramodulation,[status(thm)],[f22,f269])).
% 0.03/0.31 fof(f280,plain,(
% 0.03/0.31 ~c=c),
% 0.03/0.31 inference(forward_demodulation,[status(thm)],[f223,f278])).
% 0.03/0.31 fof(f281,plain,(
% 0.03/0.31 $false),
% 0.03/0.31 inference(trivial_equality_resolution,[status(thm)],[f280])).
% 0.03/0.31 % SZS output end CNFRefutation for theBenchmark.p
% 0.03/0.31 % Elapsed time: 0.016241 seconds
% 0.03/0.31 % CPU time: 0.041354 seconds
% 0.03/0.31 % Total memory used: 3.389 MB
% 0.03/0.31 % Net memory used: 3.364 MB
%------------------------------------------------------------------------------