%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP162-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 : n006.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.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP162-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.35 % Computer : n006.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 20 20:02:27 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Drodi V4.1.1
% 0.10/0.38 % Refutation found
% 0.10/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.38 fof(f5,axiom,(
% 0.10/0.38 (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f7,axiom,(
% 0.10/0.38 (![X,Y,Z]: (least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ))),
% 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f16,hypothesis,(
% 0.10/0.38 least_upper_bound(a,b) = b ),
% 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f17,hypothesis,(
% 0.10/0.38 least_upper_bound(b,c) = c ),
% 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f18,negated_conjecture,(
% 0.10/0.38 least_upper_bound(a,c) != c ),
% 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f23,plain,(
% 0.10/0.38 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f5])).
% 0.10/0.38 fof(f25,plain,(
% 0.10/0.38 ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(least_upper_bound(X0,X1),X2))),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f7])).
% 0.10/0.38 fof(f34,plain,(
% 0.10/0.38 least_upper_bound(a,b)=b),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f16])).
% 0.10/0.38 fof(f35,plain,(
% 0.10/0.38 least_upper_bound(b,c)=c),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f17])).
% 0.10/0.38 fof(f36,plain,(
% 0.10/0.38 ~least_upper_bound(a,c)=c),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f18])).
% 0.10/0.38 fof(f37,definition,(
% 0.10/0.38 sF0_fnc=least_upper_bound(a,c)),
% 0.10/0.38 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.10/0.38 fof(f38,plain,(
% 0.10/0.38 ~sF0_fnc=c),
% 0.10/0.38 inference(definition_folding,[],[f36,f37])).
% 0.10/0.38 fof(f47,plain,(
% 0.10/0.38 ![X0]: (least_upper_bound(a,least_upper_bound(b,X0))=least_upper_bound(b,X0))),
% 0.10/0.38 inference(paramodulation,[status(thm)],[f34,f25])).
% 0.10/0.38 fof(f48,plain,(
% 0.10/0.38 ![X0]: (least_upper_bound(a,least_upper_bound(c,X0))=least_upper_bound(sF0_fnc,X0))),
% 0.10/0.38 inference(paramodulation,[status(thm)],[f37,f25])).
% 0.10/0.38 fof(f57,plain,(
% 0.10/0.38 ![X0]: (least_upper_bound(a,least_upper_bound(X0,c))=least_upper_bound(sF0_fnc,X0))),
% 0.10/0.38 inference(paramodulation,[status(thm)],[f23,f48])).
% 0.10/0.38 fof(f245,plain,(
% 0.10/0.38 least_upper_bound(b,c)=least_upper_bound(sF0_fnc,b)),
% 0.10/0.38 inference(paramodulation,[status(thm)],[f47,f57])).
% 0.10/0.38 fof(f262,plain,(
% 0.10/0.38 c=least_upper_bound(sF0_fnc,b)),
% 0.10/0.38 inference(forward_demodulation,[status(thm)],[f35,f245])).
% 0.10/0.38 fof(f263,plain,(
% 0.10/0.38 c=least_upper_bound(b,sF0_fnc)),
% 0.10/0.38 inference(forward_demodulation,[status(thm)],[f23,f262])).
% 0.10/0.38 fof(f284,plain,(
% 0.10/0.38 least_upper_bound(a,c)=least_upper_bound(b,sF0_fnc)),
% 0.10/0.38 inference(paramodulation,[status(thm)],[f263,f47])).
% 0.10/0.38 fof(f289,plain,(
% 0.10/0.38 sF0_fnc=least_upper_bound(b,sF0_fnc)),
% 0.10/0.38 inference(forward_demodulation,[status(thm)],[f37,f284])).
% 0.10/0.38 fof(f290,plain,(
% 0.10/0.38 sF0_fnc=c),
% 0.10/0.38 inference(forward_demodulation,[status(thm)],[f263,f289])).
% 0.10/0.38 fof(f291,plain,(
% 0.10/0.38 $false),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f290,f38])).
% 0.10/0.38 % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.39 % Elapsed time: 0.028099 seconds
% 0.13/0.39 % CPU time: 0.078327 seconds
% 0.13/0.39 % Total memory used: 3.886 MB
% 0.13/0.39 % Net memory used: 3.848 MB
%------------------------------------------------------------------------------