%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP192-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 : n013.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 0.20s 0.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP192-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 : n013.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:05:06 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.47 % Drodi V4.1.1
% 0.20/0.51 % Refutation found
% 0.20/0.51 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.51 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.51 fof(f1,axiom,(
% 0.20/0.51 (![X]: (multiply(identity,X) = X ))),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f2,axiom,(
% 0.20/0.51 (![X]: (multiply(inverse(X),X) = identity ))),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f3,axiom,(
% 0.20/0.51 (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f4,axiom,(
% 0.20/0.51 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f10,axiom,(
% 0.20/0.51 (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f15,axiom,(
% 0.20/0.51 (![Y,Z,X]: (multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ))),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f16,hypothesis,(
% 0.20/0.51 (![X]: (least_upper_bound(identity,X) = X ))),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f17,negated_conjecture,(
% 0.20/0.51 multiply(a,b) != multiply(b,a) ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f18,plain,(
% 0.20/0.51 ![X0]: (multiply(identity,X0)=X0)),
% 0.20/0.51 inference(cnf_transformation,[status(thm)],[f1])).
% 0.20/0.51 fof(f19,plain,(
% 0.20/0.51 ![X0]: (multiply(inverse(X0),X0)=identity)),
% 0.20/0.51 inference(cnf_transformation,[status(thm)],[f2])).
% 0.20/0.51 fof(f20,plain,(
% 0.20/0.51 ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 0.20/0.51 inference(cnf_transformation,[status(thm)],[f3])).
% 0.20/0.51 fof(f21,plain,(
% 0.20/0.51 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.20/0.51 inference(cnf_transformation,[status(thm)],[f4])).
% 0.20/0.51 fof(f27,plain,(
% 0.20/0.51 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.20/0.51 inference(cnf_transformation,[status(thm)],[f10])).
% 0.20/0.51 fof(f32,plain,(
% 0.20/0.51 ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)))),
% 0.20/0.51 inference(cnf_transformation,[status(thm)],[f15])).
% 0.20/0.51 fof(f33,plain,(
% 0.20/0.51 ![X0]: (least_upper_bound(identity,X0)=X0)),
% 0.20/0.51 inference(cnf_transformation,[status(thm)],[f16])).
% 0.20/0.51 fof(f34,plain,(
% 0.20/0.51 ~multiply(a,b)=multiply(b,a)),
% 0.20/0.51 inference(cnf_transformation,[status(thm)],[f17])).
% 0.20/0.51 fof(f35,definition,(
% 0.20/0.51 sF0_fnc=multiply(a,b)),
% 0.20/0.51 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.20/0.51 fof(f36,definition,(
% 0.20/0.51 sF1_fnc=multiply(b,a)),
% 0.20/0.51 introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.20/0.51 fof(f37,plain,(
% 0.20/0.51 ~sF0_fnc=sF1_fnc),
% 0.20/0.51 inference(definition_folding,[],[f34,f36,f35])).
% 0.20/0.51 fof(f39,plain,(
% 0.20/0.51 ![X0,X1]: (multiply(identity,X0)=multiply(inverse(X1),multiply(X1,X0)))),
% 0.20/0.51 inference(paramodulation,[status(thm)],[f19,f20])).
% 0.20/0.51 fof(f43,plain,(
% 0.20/0.51 ![X0,X1]: (X0=multiply(inverse(X1),multiply(X1,X0)))),
% 0.20/0.51 inference(forward_demodulation,[status(thm)],[f18,f39])).
% 0.20/0.51 fof(f96,plain,(
% 0.20/0.51 ![X0]: (greatest_lower_bound(identity,X0)=identity)),
% 0.20/0.51 inference(paramodulation,[status(thm)],[f33,f27])).
% 0.20/0.51 fof(f231,plain,(
% 0.20/0.51 ![X0,X1]: (multiply(greatest_lower_bound(identity,X0),X1)=greatest_lower_bound(X1,multiply(X0,X1)))),
% 0.20/0.51 inference(paramodulation,[status(thm)],[f18,f32])).
% 0.20/0.51 fof(f244,plain,(
% 0.20/0.51 ![X0,X1]: (multiply(identity,X0)=greatest_lower_bound(X0,multiply(X1,X0)))),
% 0.20/0.51 inference(forward_demodulation,[status(thm)],[f96,f231])).
% 0.20/0.51 fof(f245,plain,(
% 0.20/0.51 ![X0,X1]: (X0=greatest_lower_bound(X0,multiply(X1,X0)))),
% 0.20/0.51 inference(forward_demodulation,[status(thm)],[f18,f244])).
% 0.20/0.51 fof(f306,plain,(
% 0.20/0.51 ![X0,X1]: (multiply(X0,X1)=greatest_lower_bound(multiply(X0,X1),X1))),
% 0.20/0.51 inference(paramodulation,[status(thm)],[f43,f245])).
% 0.20/0.51 fof(f315,plain,(
% 0.20/0.51 ![X0,X1]: (multiply(X0,X1)=greatest_lower_bound(X1,multiply(X0,X1)))),
% 0.20/0.51 inference(forward_demodulation,[status(thm)],[f21,f306])).
% 0.20/0.51 fof(f316,plain,(
% 0.20/0.51 ![X0,X1]: (multiply(X0,X1)=X1)),
% 0.20/0.51 inference(forward_demodulation,[status(thm)],[f245,f315])).
% 0.20/0.51 fof(f397,plain,(
% 0.20/0.51 sF1_fnc=a),
% 0.20/0.51 inference(backward_demodulation,[status(thm)],[f316,f36])).
% 0.20/0.51 fof(f400,plain,(
% 0.20/0.51 sF0_fnc=b),
% 0.20/0.51 inference(backward_demodulation,[status(thm)],[f316,f35])).
% 0.20/0.51 fof(f403,plain,(
% 0.20/0.51 ![X0]: (X0=identity)),
% 0.20/0.51 inference(backward_demodulation,[status(thm)],[f316,f19])).
% 0.20/0.51 fof(f416,plain,(
% 0.20/0.51 ~sF0_fnc=a),
% 0.20/0.51 inference(backward_demodulation,[status(thm)],[f397,f37])).
% 0.20/0.51 fof(f420,plain,(
% 0.20/0.51 ~b=a),
% 0.20/0.51 inference(forward_demodulation,[status(thm)],[f400,f416])).
% 0.20/0.51 fof(f421,plain,(
% 0.20/0.51 ~identity=a),
% 0.20/0.51 inference(paramodulation,[status(thm)],[f403,f420])).
% 0.20/0.51 fof(f422,plain,(
% 0.20/0.51 $false),
% 0.20/0.51 inference(forward_subsumption_resolution,[status(thm)],[f421,f403])).
% 0.20/0.51 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.54 % Elapsed time: 0.075062 seconds
% 0.20/0.54 % CPU time: 0.275471 seconds
% 0.20/0.54 % Total memory used: 9.674 MB
% 0.20/0.54 % Net memory used: 9.541 MB
%------------------------------------------------------------------------------