%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP169-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 : 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:09 PM UTC 2026
% Result : Unsatisfiable 0.15s 10.79s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP169-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.10/10.53 % Computer : n006.cluster.edu
% 0.10/10.53 % Model : x86_64 x86_64
% 0.10/10.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.53 % Memory : 8046.5625MB
% 0.10/10.53 % OS : Linux 6.8.0-71-generic
% 0.10/10.53 % CPULimit : 300
% 0.10/10.53 % WCLimit : 300
% 0.10/10.53 % DateTime : Sun Sep 20 20:03:42 UTC 2026
% 0.10/10.53 % CPUTime :
% 0.10/10.54 % Drodi V4.1.1
% 0.15/10.79 % Refutation found
% 0.15/10.79 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/10.79 % SZS output start CNFRefutation for theBenchmark
% 0.15/10.79 fof(f1,axiom,(
% 0.15/10.79 (![X]: (multiply(identity,X) = X ))),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f2,axiom,(
% 0.15/10.79 (![X]: (multiply(inverse(X),X) = identity ))),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f3,axiom,(
% 0.15/10.79 (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f4,axiom,(
% 0.15/10.79 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f6,axiom,(
% 0.15/10.79 (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f9,axiom,(
% 0.15/10.79 (![X]: (greatest_lower_bound(X,X) = X ))),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f13,axiom,(
% 0.15/10.79 (![X,Y,Z]: (multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ))),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f15,axiom,(
% 0.15/10.79 (![Y,Z,X]: (multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ))),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f16,hypothesis,(
% 0.15/10.79 greatest_lower_bound(inverse(a),inverse(b)) = inverse(a) ),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f17,negated_conjecture,(
% 0.15/10.79 greatest_lower_bound(a,b) != b ),
% 0.15/10.79 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/10.79 fof(f18,plain,(
% 0.15/10.79 ![X0]: (multiply(identity,X0)=X0)),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f1])).
% 0.15/10.79 fof(f19,plain,(
% 0.15/10.79 ![X0]: (multiply(inverse(X0),X0)=identity)),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f2])).
% 0.15/10.79 fof(f20,plain,(
% 0.15/10.79 ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f3])).
% 0.15/10.79 fof(f21,plain,(
% 0.15/10.79 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f4])).
% 0.15/10.79 fof(f23,plain,(
% 0.15/10.79 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f6])).
% 0.15/10.79 fof(f26,plain,(
% 0.15/10.79 ![X0]: (greatest_lower_bound(X0,X0)=X0)),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f9])).
% 0.15/10.79 fof(f30,plain,(
% 0.15/10.79 ![X0,X1,X2]: (multiply(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)))),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f13])).
% 0.15/10.79 fof(f32,plain,(
% 0.15/10.79 ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)))),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f15])).
% 0.15/10.79 fof(f33,plain,(
% 0.15/10.79 greatest_lower_bound(inverse(a),inverse(b))=inverse(a)),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f16])).
% 0.15/10.79 fof(f34,plain,(
% 0.15/10.79 ~greatest_lower_bound(a,b)=b),
% 0.15/10.79 inference(cnf_transformation,[status(thm)],[f17])).
% 0.15/10.79 fof(f35,definition,(
% 0.15/10.79 sF0_fnc=greatest_lower_bound(a,b)),
% 0.15/10.79 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.15/10.79 fof(f36,plain,(
% 0.15/10.79 ~sF0_fnc=b),
% 0.15/10.79 inference(definition_folding,[],[f34,f35])).
% 0.15/10.79 fof(f42,plain,(
% 0.15/10.79 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(X2,greatest_lower_bound(X0,X1)))),
% 0.15/10.79 inference(paramodulation,[status(thm)],[f21,f23])).
% 0.15/10.79 fof(f47,plain,(
% 0.15/10.79 ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X0,X1))=greatest_lower_bound(X0,X1))),
% 0.15/10.79 inference(paramodulation,[status(thm)],[f26,f23])).
% 0.15/10.79 fof(f58,plain,(
% 0.15/10.79 greatest_lower_bound(a,sF0_fnc)=greatest_lower_bound(a,b)),
% 0.15/10.79 inference(paramodulation,[status(thm)],[f35,f47])).
% 0.15/10.79 fof(f70,plain,(
% 0.15/10.79 greatest_lower_bound(a,sF0_fnc)=sF0_fnc),
% 0.15/10.79 inference(forward_demodulation,[status(thm)],[f35,f58])).
% 0.15/10.79 fof(f107,plain,(
% 0.15/10.79 ![X0,X1]: (multiply(greatest_lower_bound(inverse(X0),X1),X0)=greatest_lower_bound(identity,multiply(X1,X0)))),
% 0.15/10.79 inference(paramodulation,[status(thm)],[f19,f32])).
% 0.15/10.79 fof(f109,plain,(
% 0.15/10.80 ![X0,X1]: (multiply(inverse(X0),greatest_lower_bound(X0,X1))=greatest_lower_bound(identity,multiply(inverse(X0),X1)))),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f19,f30])).
% 0.15/10.80 fof(f125,plain,(
% 0.15/10.80 ![X0,X1]: (multiply(identity,X0)=multiply(inverse(X1),multiply(X1,X0)))),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f19,f20])).
% 0.15/10.80 fof(f133,plain,(
% 0.15/10.80 ![X0,X1]: (X0=multiply(inverse(X1),multiply(X1,X0)))),
% 0.15/10.80 inference(forward_demodulation,[status(thm)],[f18,f125])).
% 0.15/10.80 fof(f280,plain,(
% 0.15/10.80 ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X0,X1))=greatest_lower_bound(X1,X0))),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f26,f42])).
% 0.15/10.80 fof(f400,plain,(
% 0.15/10.80 ![X0,X1]: (multiply(X0,X1)=multiply(inverse(inverse(X0)),X1))),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f133,f133])).
% 0.15/10.80 fof(f401,plain,(
% 0.15/10.80 ![X0]: (X0=multiply(inverse(inverse(X0)),identity))),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f19,f133])).
% 0.15/10.80 fof(f408,plain,(
% 0.15/10.80 ![X0]: (X0=multiply(X0,identity))),
% 0.15/10.80 inference(forward_demodulation,[status(thm)],[f400,f401])).
% 0.15/10.80 fof(f732,plain,(
% 0.15/10.80 greatest_lower_bound(a,sF0_fnc)=greatest_lower_bound(b,a)),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f35,f280])).
% 0.15/10.80 fof(f789,plain,(
% 0.15/10.80 sF0_fnc=greatest_lower_bound(b,a)),
% 0.15/10.80 inference(forward_demodulation,[status(thm)],[f70,f732])).
% 0.15/10.80 fof(f1849,plain,(
% 0.15/10.80 multiply(inverse(a),a)=greatest_lower_bound(identity,multiply(inverse(b),a))),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f33,f107])).
% 0.15/10.80 fof(f1887,plain,(
% 0.15/10.80 identity=greatest_lower_bound(identity,multiply(inverse(b),a))),
% 0.15/10.80 inference(forward_demodulation,[status(thm)],[f19,f1849])).
% 0.15/10.80 fof(f2004,plain,(
% 0.15/10.80 ![X0,X1]: (multiply(X0,multiply(inverse(X0),X1))=X1)),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f133,f400])).
% 0.15/10.80 fof(f2219,plain,(
% 0.15/10.80 multiply(inverse(b),sF0_fnc)=greatest_lower_bound(identity,multiply(inverse(b),a))),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f789,f109])).
% 0.15/10.80 fof(f2280,plain,(
% 0.15/10.80 multiply(inverse(b),sF0_fnc)=identity),
% 0.15/10.80 inference(forward_demodulation,[status(thm)],[f1887,f2219])).
% 0.15/10.80 fof(f2699,plain,(
% 0.15/10.80 multiply(b,identity)=sF0_fnc),
% 0.15/10.80 inference(paramodulation,[status(thm)],[f2280,f2004])).
% 0.15/10.80 fof(f2718,plain,(
% 0.15/10.80 b=sF0_fnc),
% 0.15/10.80 inference(forward_demodulation,[status(thm)],[f408,f2699])).
% 0.15/10.80 fof(f2719,plain,(
% 0.15/10.80 $false),
% 0.15/10.80 inference(forward_subsumption_resolution,[status(thm)],[f2718,f36])).
% 0.15/10.80 % SZS output end CNFRefutation for theBenchmark.p
% 0.15/10.81 % Elapsed time: 0.270759 seconds
% 0.15/10.81 % CPU time: 2.057528 seconds
% 0.15/10.81 % Total memory used: 40.983 MB
% 0.15/10.81 % Net memory used: 40.342 MB
%------------------------------------------------------------------------------