%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP172-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 : n018.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.12s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP172-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n018.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 20:05:28 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.36 % Drodi V4.1.1
% 0.12/0.40 % Refutation found
% 0.12/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.40 % SZS output start CNFRefutation for theBenchmark
% 0.12/0.40 fof(f1,axiom,(
% 0.12/0.40 (![X]: (multiply(identity,X) = X ))),
% 0.12/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40 fof(f4,axiom,(
% 0.12/0.40 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.12/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40 fof(f6,axiom,(
% 0.12/0.40 (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 0.12/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40 fof(f15,axiom,(
% 0.12/0.40 (![Y,Z,X]: (multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ))),
% 0.12/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40 fof(f16,hypothesis,(
% 0.12/0.40 greatest_lower_bound(identity,a) = identity ),
% 0.12/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40 fof(f17,hypothesis,(
% 0.12/0.40 greatest_lower_bound(identity,b) = identity ),
% 0.12/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40 fof(f18,negated_conjecture,(
% 0.12/0.40 greatest_lower_bound(identity,multiply(a,b)) != identity ),
% 0.12/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40 fof(f19,plain,(
% 0.12/0.40 ![X0]: (multiply(identity,X0)=X0)),
% 0.12/0.40 inference(cnf_transformation,[status(thm)],[f1])).
% 0.12/0.40 fof(f22,plain,(
% 0.12/0.40 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.12/0.40 inference(cnf_transformation,[status(thm)],[f4])).
% 0.12/0.40 fof(f24,plain,(
% 0.12/0.40 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.12/0.40 inference(cnf_transformation,[status(thm)],[f6])).
% 0.12/0.40 fof(f33,plain,(
% 0.12/0.40 ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)))),
% 0.12/0.40 inference(cnf_transformation,[status(thm)],[f15])).
% 0.12/0.40 fof(f34,plain,(
% 0.12/0.40 greatest_lower_bound(identity,a)=identity),
% 0.12/0.40 inference(cnf_transformation,[status(thm)],[f16])).
% 0.12/0.40 fof(f35,plain,(
% 0.12/0.40 greatest_lower_bound(identity,b)=identity),
% 0.12/0.40 inference(cnf_transformation,[status(thm)],[f17])).
% 0.12/0.40 fof(f36,plain,(
% 0.12/0.40 ~greatest_lower_bound(identity,multiply(a,b))=identity),
% 0.12/0.40 inference(cnf_transformation,[status(thm)],[f18])).
% 0.12/0.40 fof(f41,plain,(
% 0.12/0.40 identity=greatest_lower_bound(a,identity)),
% 0.12/0.40 inference(paramodulation,[status(thm)],[f34,f22])).
% 0.12/0.40 fof(f62,plain,(
% 0.12/0.40 ![X0]: (greatest_lower_bound(identity,greatest_lower_bound(b,X0))=greatest_lower_bound(identity,X0))),
% 0.12/0.40 inference(paramodulation,[status(thm)],[f35,f24])).
% 0.12/0.40 fof(f216,plain,(
% 0.12/0.40 ![X0,X1]: (multiply(greatest_lower_bound(X0,identity),X1)=greatest_lower_bound(multiply(X0,X1),X1))),
% 0.12/0.40 inference(paramodulation,[status(thm)],[f19,f33])).
% 0.12/0.40 fof(f234,plain,(
% 0.12/0.40 ![X0]: (multiply(identity,X0)=greatest_lower_bound(multiply(a,X0),X0))),
% 0.12/0.40 inference(paramodulation,[status(thm)],[f41,f216])).
% 0.12/0.40 fof(f258,plain,(
% 0.12/0.40 ![X0]: (X0=greatest_lower_bound(multiply(a,X0),X0))),
% 0.12/0.40 inference(forward_demodulation,[status(thm)],[f19,f234])).
% 0.12/0.40 fof(f277,plain,(
% 0.12/0.40 ![X0]: (X0=greatest_lower_bound(X0,multiply(a,X0)))),
% 0.12/0.40 inference(paramodulation,[status(thm)],[f22,f258])).
% 0.12/0.40 fof(f480,plain,(
% 0.12/0.40 greatest_lower_bound(identity,b)=greatest_lower_bound(identity,multiply(a,b))),
% 0.12/0.40 inference(paramodulation,[status(thm)],[f277,f62])).
% 0.12/0.40 fof(f499,plain,(
% 0.12/0.40 identity=greatest_lower_bound(identity,multiply(a,b))),
% 0.12/0.40 inference(forward_demodulation,[status(thm)],[f35,f480])).
% 0.12/0.40 fof(f500,plain,(
% 0.12/0.40 $false),
% 0.12/0.40 inference(forward_subsumption_resolution,[status(thm)],[f499,f36])).
% 0.12/0.40 % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.42 % Elapsed time: 0.064391 seconds
% 0.12/0.42 % CPU time: 0.336810 seconds
% 0.12/0.42 % Total memory used: 12.420 MB
% 0.12/0.42 % Net memory used: 12.305 MB
%------------------------------------------------------------------------------