%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP165-2 : 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 : n001.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.11s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP165-2 : 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.11/0.36 % Computer : n001.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 20:08:27 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.37 % Drodi V4.1.1
% 0.11/0.39 % Refutation found
% 0.11/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.39 % SZS output start CNFRefutation for theBenchmark
% 0.11/0.39 fof(f1,axiom,(
% 0.11/0.39 (![X]: (multiply(identity,X) = X ))),
% 0.11/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39 fof(f2,axiom,(
% 0.11/0.39 (![X]: (multiply(inverse(X),X) = identity ))),
% 0.11/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39 fof(f3,axiom,(
% 0.11/0.39 (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 0.11/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39 fof(f4,axiom,(
% 0.11/0.39 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.11/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39 fof(f13,axiom,(
% 0.11/0.39 (![X,Y,Z]: (multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ))),
% 0.11/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39 fof(f16,hypothesis,(
% 0.11/0.39 greatest_lower_bound(a,identity) = identity ),
% 0.11/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39 fof(f17,negated_conjecture,(
% 0.11/0.39 greatest_lower_bound(a,multiply(a,a)) != a ),
% 0.11/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39 fof(f18,plain,(
% 0.11/0.39 ![X0]: (multiply(identity,X0)=X0)),
% 0.11/0.39 inference(cnf_transformation,[status(thm)],[f1])).
% 0.11/0.39 fof(f19,plain,(
% 0.11/0.39 ![X0]: (multiply(inverse(X0),X0)=identity)),
% 0.11/0.39 inference(cnf_transformation,[status(thm)],[f2])).
% 0.11/0.39 fof(f20,plain,(
% 0.11/0.39 ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 0.11/0.39 inference(cnf_transformation,[status(thm)],[f3])).
% 0.11/0.39 fof(f21,plain,(
% 0.11/0.39 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.11/0.39 inference(cnf_transformation,[status(thm)],[f4])).
% 0.11/0.39 fof(f30,plain,(
% 0.11/0.39 ![X0,X1,X2]: (multiply(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)))),
% 0.11/0.39 inference(cnf_transformation,[status(thm)],[f13])).
% 0.11/0.39 fof(f33,plain,(
% 0.11/0.39 greatest_lower_bound(a,identity)=identity),
% 0.11/0.39 inference(cnf_transformation,[status(thm)],[f16])).
% 0.11/0.39 fof(f34,plain,(
% 0.11/0.39 ~greatest_lower_bound(a,multiply(a,a))=a),
% 0.11/0.39 inference(cnf_transformation,[status(thm)],[f17])).
% 0.11/0.39 fof(f35,definition,(
% 0.11/0.39 sF1_fnc=multiply(a,a)),
% 0.11/0.39 introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.11/0.39 fof(f36,definition,(
% 0.11/0.39 sF0_fnc=greatest_lower_bound(a,sF1_fnc)),
% 0.11/0.39 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.11/0.39 fof(f37,plain,(
% 0.11/0.39 ~sF0_fnc=a),
% 0.11/0.39 inference(definition_folding,[],[f34,f36,f35])).
% 0.11/0.39 fof(f47,plain,(
% 0.11/0.39 ![X0,X1]: (multiply(identity,X0)=multiply(inverse(X1),multiply(X1,X0)))),
% 0.11/0.39 inference(paramodulation,[status(thm)],[f19,f20])).
% 0.11/0.39 fof(f48,plain,(
% 0.11/0.39 ![X0,X1]: (X0=multiply(inverse(X1),multiply(X1,X0)))),
% 0.11/0.39 inference(forward_demodulation,[status(thm)],[f18,f47])).
% 0.11/0.39 fof(f91,plain,(
% 0.11/0.39 ![X0,X1]: (multiply(X0,X1)=multiply(inverse(inverse(X0)),X1))),
% 0.11/0.39 inference(paramodulation,[status(thm)],[f48,f48])).
% 0.11/0.39 fof(f92,plain,(
% 0.11/0.39 ![X0]: (X0=multiply(inverse(inverse(X0)),identity))),
% 0.11/0.39 inference(paramodulation,[status(thm)],[f19,f48])).
% 0.11/0.39 fof(f98,plain,(
% 0.11/0.39 ![X0]: (X0=multiply(X0,identity))),
% 0.11/0.39 inference(forward_demodulation,[status(thm)],[f91,f92])).
% 0.11/0.39 fof(f108,plain,(
% 0.11/0.39 ![X0]: (multiply(a,greatest_lower_bound(a,X0))=greatest_lower_bound(sF1_fnc,multiply(a,X0)))),
% 0.11/0.39 inference(paramodulation,[status(thm)],[f35,f30])).
% 0.11/0.39 fof(f240,plain,(
% 0.11/0.39 multiply(a,greatest_lower_bound(a,identity))=greatest_lower_bound(sF1_fnc,a)),
% 0.11/0.39 inference(paramodulation,[status(thm)],[f98,f108])).
% 0.11/0.39 fof(f248,plain,(
% 0.11/0.39 multiply(a,identity)=greatest_lower_bound(sF1_fnc,a)),
% 0.11/0.39 inference(forward_demodulation,[status(thm)],[f33,f240])).
% 0.11/0.39 fof(f249,plain,(
% 0.11/0.39 a=greatest_lower_bound(sF1_fnc,a)),
% 0.11/0.39 inference(forward_demodulation,[status(thm)],[f98,f248])).
% 0.11/0.39 fof(f256,plain,(
% 0.11/0.39 a=greatest_lower_bound(a,sF1_fnc)),
% 0.11/0.39 inference(paramodulation,[status(thm)],[f21,f249])).
% 0.11/0.39 fof(f263,plain,(
% 0.11/0.39 sF0_fnc=a),
% 0.11/0.39 inference(backward_demodulation,[status(thm)],[f256,f36])).
% 0.11/0.39 fof(f265,plain,(
% 0.11/0.39 $false),
% 0.11/0.39 inference(forward_subsumption_resolution,[status(thm)],[f263,f37])).
% 0.11/0.39 % SZS output end CNFRefutation for theBenchmark.p
% 0.11/0.41 % Elapsed time: 0.037161 seconds
% 0.11/0.41 % CPU time: 0.103388 seconds
% 0.11/0.41 % Total memory used: 4.089 MB
% 0.11/0.41 % Net memory used: 4.057 MB
%------------------------------------------------------------------------------