%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP174-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 : 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:10 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.56s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP174-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 % Computer : n007.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Sun Sep 20 20:02:05 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.46 % Drodi V4.1.1
% 0.20/0.56 % Refutation found
% 0.20/0.56 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.56 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.56 fof(f1,axiom,(
% 0.20/0.56 (![X]: (multiply(identity,X) = X ))),
% 0.20/0.56 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.56 fof(f2,axiom,(
% 0.20/0.56 (![X]: (multiply(inverse(X),X) = identity ))),
% 0.20/0.56 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.56 fof(f5,axiom,(
% 0.20/0.56 (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.20/0.56 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.56 fof(f10,axiom,(
% 0.20/0.56 (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.20/0.56 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.56 fof(f14,axiom,(
% 0.20/0.56 (![Y,Z,X]: (multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ))),
% 0.20/0.56 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.56 fof(f16,hypothesis,(
% 0.20/0.56 greatest_lower_bound(identity,a) = a ),
% 0.20/0.56 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.56 fof(f17,hypothesis,(
% 0.20/0.56 greatest_lower_bound(identity,inverse(a)) = inverse(a) ),
% 0.20/0.56 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.56 fof(f18,negated_conjecture,(
% 0.20/0.56 identity != a ),
% 0.20/0.56 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.56 fof(f19,plain,(
% 0.20/0.56 ![X0]: (multiply(identity,X0)=X0)),
% 0.20/0.56 inference(cnf_transformation,[status(thm)],[f1])).
% 0.20/0.56 fof(f20,plain,(
% 0.20/0.56 ![X0]: (multiply(inverse(X0),X0)=identity)),
% 0.20/0.56 inference(cnf_transformation,[status(thm)],[f2])).
% 0.20/0.56 fof(f23,plain,(
% 0.20/0.56 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.20/0.56 inference(cnf_transformation,[status(thm)],[f5])).
% 0.20/0.56 fof(f28,plain,(
% 0.20/0.56 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.20/0.56 inference(cnf_transformation,[status(thm)],[f10])).
% 0.20/0.56 fof(f32,plain,(
% 0.20/0.56 ![X0,X1,X2]: (multiply(least_upper_bound(X0,X1),X2)=least_upper_bound(multiply(X0,X2),multiply(X1,X2)))),
% 0.20/0.56 inference(cnf_transformation,[status(thm)],[f14])).
% 0.20/0.56 fof(f34,plain,(
% 0.20/0.56 greatest_lower_bound(identity,a)=a),
% 0.20/0.56 inference(cnf_transformation,[status(thm)],[f16])).
% 0.20/0.56 fof(f35,plain,(
% 0.20/0.56 greatest_lower_bound(identity,inverse(a))=inverse(a)),
% 0.20/0.56 inference(cnf_transformation,[status(thm)],[f17])).
% 0.20/0.56 fof(f36,plain,(
% 0.20/0.56 ~identity=a),
% 0.20/0.56 inference(cnf_transformation,[status(thm)],[f18])).
% 0.20/0.56 fof(f82,plain,(
% 0.20/0.56 least_upper_bound(identity,a)=identity),
% 0.20/0.56 inference(paramodulation,[status(thm)],[f34,f28])).
% 0.20/0.56 fof(f119,plain,(
% 0.20/0.56 least_upper_bound(a,identity)=identity),
% 0.20/0.56 inference(paramodulation,[status(thm)],[f23,f82])).
% 0.20/0.56 fof(f237,plain,(
% 0.20/0.56 ![X0,X1]: (multiply(least_upper_bound(identity,X0),X1)=least_upper_bound(X1,multiply(X0,X1)))),
% 0.20/0.56 inference(paramodulation,[status(thm)],[f19,f32])).
% 0.20/0.56 fof(f293,plain,(
% 0.20/0.56 ![X0,X1]: (multiply(identity,X0)=least_upper_bound(X0,multiply(greatest_lower_bound(identity,X1),X0)))),
% 0.20/0.56 inference(paramodulation,[status(thm)],[f28,f237])).
% 0.20/0.56 fof(f321,plain,(
% 0.20/0.56 ![X0,X1]: (X0=least_upper_bound(X0,multiply(greatest_lower_bound(identity,X1),X0)))),
% 0.20/0.56 inference(forward_demodulation,[status(thm)],[f19,f293])).
% 0.20/0.56 fof(f775,plain,(
% 0.20/0.56 ![X0]: (X0=least_upper_bound(X0,multiply(inverse(a),X0)))),
% 0.20/0.56 inference(paramodulation,[status(thm)],[f35,f321])).
% 0.20/0.56 fof(f810,plain,(
% 0.20/0.56 a=least_upper_bound(a,identity)),
% 0.20/0.56 inference(paramodulation,[status(thm)],[f20,f775])).
% 0.20/0.56 fof(f824,plain,(
% 0.20/0.56 a=identity),
% 0.20/0.56 inference(backward_demodulation,[status(thm)],[f810,f119])).
% 0.20/0.56 fof(f835,plain,(
% 0.20/0.56 $false),
% 0.20/0.56 inference(forward_subsumption_resolution,[status(thm)],[f824,f36])).
% 0.20/0.56 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.59 % Elapsed time: 0.116933 seconds
% 0.20/0.59 % CPU time: 0.680698 seconds
% 0.20/0.59 % Total memory used: 16.455 MB
% 0.20/0.59 % Net memory used: 16.256 MB
%------------------------------------------------------------------------------