%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP191-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 : n009.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:14 PM UTC 2026
% Result : Unsatisfiable 1.99s 0.81s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP191-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n009.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:05:43 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Drodi V4.1.1
% 1.99/0.81 % Refutation found
% 1.99/0.81 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 1.99/0.81 % SZS output start CNFRefutation for theBenchmark
% 1.99/0.81 fof(f1,axiom,(
% 1.99/0.81 (![X]: (multiply(identity,X) = X ))),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f2,axiom,(
% 1.99/0.81 (![X]: (multiply(inverse(X),X) = identity ))),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f3,axiom,(
% 1.99/0.81 (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f5,axiom,(
% 1.99/0.81 (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f10,axiom,(
% 1.99/0.81 (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f11,axiom,(
% 1.99/0.81 (![X,Y]: (greatest_lower_bound(X,least_upper_bound(X,Y)) = X ))),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f13,axiom,(
% 1.99/0.81 (![X,Y,Z]: (multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ))),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f15,axiom,(
% 1.99/0.81 (![Y,Z,X]: (multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ))),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f16,hypothesis,(
% 1.99/0.81 greatest_lower_bound(a,b) = b ),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f17,negated_conjecture,(
% 1.99/0.81 greatest_lower_bound(inverse(a),inverse(b)) != inverse(a) ),
% 1.99/0.81 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.99/0.81 fof(f18,plain,(
% 1.99/0.81 ![X0]: (multiply(identity,X0)=X0)),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f1])).
% 1.99/0.81 fof(f19,plain,(
% 1.99/0.81 ![X0]: (multiply(inverse(X0),X0)=identity)),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f2])).
% 1.99/0.81 fof(f20,plain,(
% 1.99/0.81 ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f3])).
% 1.99/0.81 fof(f22,plain,(
% 1.99/0.81 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f5])).
% 1.99/0.81 fof(f27,plain,(
% 1.99/0.81 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f10])).
% 1.99/0.81 fof(f28,plain,(
% 1.99/0.81 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X0,X1))=X0)),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f11])).
% 1.99/0.81 fof(f30,plain,(
% 1.99/0.81 ![X0,X1,X2]: (multiply(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)))),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f13])).
% 1.99/0.81 fof(f32,plain,(
% 1.99/0.81 ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)))),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f15])).
% 1.99/0.81 fof(f33,plain,(
% 1.99/0.81 greatest_lower_bound(a,b)=b),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f16])).
% 1.99/0.81 fof(f34,plain,(
% 1.99/0.81 ~greatest_lower_bound(inverse(a),inverse(b))=inverse(a)),
% 1.99/0.81 inference(cnf_transformation,[status(thm)],[f17])).
% 1.99/0.81 fof(f35,definition,(
% 1.99/0.81 sF1_fnc=inverse(a)),
% 1.99/0.81 introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 1.99/0.81 fof(f36,definition,(
% 1.99/0.81 sF2_fnc=inverse(b)),
% 1.99/0.81 introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition])).
% 1.99/0.81 fof(f37,definition,(
% 1.99/0.81 sF0_fnc=greatest_lower_bound(sF1_fnc,sF2_fnc)),
% 1.99/0.81 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 1.99/0.81 fof(f38,plain,(
% 1.99/0.81 ~sF0_fnc=sF1_fnc),
% 1.99/0.81 inference(definition_folding,[],[f34,f37,f36,f35])).
% 1.99/0.81 fof(f55,plain,(
% 1.99/0.81 multiply(sF2_fnc,b)=identity),
% 1.99/0.81 inference(paramodulation,[status(thm)],[f36,f19])).
% 1.99/0.81 fof(f56,plain,(
% 1.99/0.81 multiply(sF1_fnc,a)=identity),
% 1.99/0.81 inference(paramodulation,[status(thm)],[f35,f19])).
% 1.99/0.81 fof(f58,plain,(
% 1.99/0.81 ![X0,X1]: (multiply(identity,X0)=multiply(inverse(X1),multiply(X1,X0)))),
% 1.99/0.81 inference(paramodulation,[status(thm)],[f19,f20])).
% 1.99/0.81 fof(f62,plain,(
% 1.99/0.81 ![X0,X1]: (X0=multiply(inverse(X1),multiply(X1,X0)))),
% 1.99/0.81 inference(forward_demodulation,[status(thm)],[f18,f58])).
% 1.99/0.81 fof(f82,plain,(
% 1.99/0.81 ![X0]: (multiply(identity,X0)=multiply(sF1_fnc,multiply(a,X0)))),
% 1.99/0.81 inference(paramodulation,[status(thm)],[f56,f20])).
% 3.03/0.82 fof(f83,plain,(
% 3.03/0.82 ![X0]: (X0=multiply(sF1_fnc,multiply(a,X0)))),
% 3.03/0.82 inference(forward_demodulation,[status(thm)],[f18,f82])).
% 3.03/0.82 fof(f89,plain,(
% 3.03/0.82 ![X0]: (multiply(sF2_fnc,greatest_lower_bound(b,X0))=greatest_lower_bound(identity,multiply(sF2_fnc,X0)))),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f55,f30])).
% 3.03/0.82 fof(f114,plain,(
% 3.03/0.82 ![X0]: (multiply(greatest_lower_bound(sF1_fnc,X0),a)=greatest_lower_bound(identity,multiply(X0,a)))),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f56,f32])).
% 3.03/0.82 fof(f133,plain,(
% 3.03/0.82 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X1,X0))=X0)),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f22,f28])).
% 3.03/0.82 fof(f150,plain,(
% 3.03/0.82 least_upper_bound(a,b)=a),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f33,f27])).
% 3.03/0.82 fof(f317,plain,(
% 3.03/0.82 greatest_lower_bound(b,a)=b),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f150,f133])).
% 3.03/0.82 fof(f472,plain,(
% 3.03/0.82 ![X0,X1]: (multiply(X0,X1)=multiply(inverse(inverse(X0)),X1))),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f62,f62])).
% 3.03/0.82 fof(f473,plain,(
% 3.03/0.82 ![X0]: (X0=multiply(inverse(inverse(X0)),identity))),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f19,f62])).
% 3.03/0.82 fof(f486,plain,(
% 3.03/0.82 ![X0]: (X0=multiply(X0,identity))),
% 3.03/0.82 inference(forward_demodulation,[status(thm)],[f472,f473])).
% 3.03/0.82 fof(f3787,plain,(
% 3.03/0.82 multiply(greatest_lower_bound(sF1_fnc,sF2_fnc),a)=multiply(sF2_fnc,greatest_lower_bound(b,a))),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f89,f114])).
% 3.03/0.82 fof(f3812,plain,(
% 3.03/0.82 multiply(sF0_fnc,a)=multiply(sF2_fnc,greatest_lower_bound(b,a))),
% 3.03/0.82 inference(forward_demodulation,[status(thm)],[f37,f3787])).
% 3.03/0.82 fof(f3813,plain,(
% 3.03/0.82 multiply(sF0_fnc,a)=multiply(sF2_fnc,b)),
% 3.03/0.82 inference(forward_demodulation,[status(thm)],[f317,f3812])).
% 3.03/0.82 fof(f3814,plain,(
% 3.03/0.82 multiply(sF0_fnc,a)=identity),
% 3.03/0.82 inference(forward_demodulation,[status(thm)],[f55,f3813])).
% 3.03/0.82 fof(f3862,plain,(
% 3.03/0.82 a=multiply(inverse(sF0_fnc),identity)),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f3814,f62])).
% 3.03/0.82 fof(f3880,plain,(
% 3.03/0.82 a=inverse(sF0_fnc)),
% 3.03/0.82 inference(forward_demodulation,[status(thm)],[f486,f3862])).
% 3.03/0.82 fof(f3908,plain,(
% 3.03/0.82 multiply(a,sF0_fnc)=identity),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f3880,f19])).
% 3.03/0.82 fof(f3917,plain,(
% 3.03/0.82 sF0_fnc=multiply(sF1_fnc,identity)),
% 3.03/0.82 inference(paramodulation,[status(thm)],[f3908,f83])).
% 3.03/0.82 fof(f3944,plain,(
% 3.03/0.82 sF0_fnc=sF1_fnc),
% 3.03/0.82 inference(forward_demodulation,[status(thm)],[f486,f3917])).
% 3.03/0.82 fof(f3945,plain,(
% 3.03/0.82 $false),
% 3.03/0.82 inference(forward_subsumption_resolution,[status(thm)],[f3944,f38])).
% 3.03/0.82 % SZS output end CNFRefutation for theBenchmark.p
% 0.53/0.84 % Elapsed time: 0.456406 seconds
% 0.53/0.84 % CPU time: 3.370132 seconds
% 0.53/0.84 % Total memory used: 56.564 MB
% 0.53/0.84 % Net memory used: 55.656 MB
%------------------------------------------------------------------------------