↑ Up

Drodi-SAT---4.1.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : GRP175-4 : 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 : n020.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.13s 0.45s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP175-4 : 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/0.36  % Computer : n020.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 20:04:48 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.13/0.45  % Refutation found
% 0.13/0.45  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.45  % SZS output start CNFRefutation for theBenchmark
% 0.13/0.45  fof(f1,axiom,(
% 0.13/0.45    (![X]: (multiply(identity,X) = X ))),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f2,axiom,(
% 0.13/0.45    (![X]: (multiply(inverse(X),X) = identity ))),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f4,axiom,(
% 0.13/0.45    (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f5,axiom,(
% 0.13/0.45    (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f10,axiom,(
% 0.13/0.45    (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f12,axiom,(
% 0.13/0.45    (![X,Y,Z]: (multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ))),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f14,axiom,(
% 0.13/0.45    (![Y,Z,X]: (multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ))),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f16,hypothesis,(
% 0.13/0.45    greatest_lower_bound(identity,b) = identity ),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f17,negated_conjecture,(
% 0.13/0.45    least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) != multiply(inverse(a),multiply(b,a)) ),
% 0.13/0.45    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.45  fof(f18,plain,(
% 0.13/0.45    ![X0]: (multiply(identity,X0)=X0)),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f1])).
% 0.13/0.45  fof(f19,plain,(
% 0.13/0.45    ![X0]: (multiply(inverse(X0),X0)=identity)),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f2])).
% 0.13/0.45  fof(f21,plain,(
% 0.13/0.45    ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f4])).
% 0.13/0.45  fof(f22,plain,(
% 0.13/0.45    ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f5])).
% 0.13/0.45  fof(f27,plain,(
% 0.13/0.45    ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f10])).
% 0.13/0.45  fof(f29,plain,(
% 0.13/0.45    ![X0,X1,X2]: (multiply(X0,least_upper_bound(X1,X2))=least_upper_bound(multiply(X0,X1),multiply(X0,X2)))),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f12])).
% 0.13/0.45  fof(f31,plain,(
% 0.13/0.45    ![X0,X1,X2]: (multiply(least_upper_bound(X0,X1),X2)=least_upper_bound(multiply(X0,X2),multiply(X1,X2)))),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f14])).
% 0.13/0.45  fof(f33,plain,(
% 0.13/0.45    greatest_lower_bound(identity,b)=identity),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f16])).
% 0.13/0.45  fof(f34,plain,(
% 0.13/0.45    ~least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))=multiply(inverse(a),multiply(b,a))),
% 0.13/0.45    inference(cnf_transformation,[status(thm)],[f17])).
% 0.13/0.45  fof(f161,plain,(
% 0.13/0.45    ![X0,X1]: (multiply(inverse(X0),least_upper_bound(X0,X1))=least_upper_bound(identity,multiply(inverse(X0),X1)))),
% 0.13/0.45    inference(paramodulation,[status(thm)],[f19,f29])).
% 0.13/0.45  fof(f182,plain,(
% 0.13/0.45    ~multiply(inverse(a),least_upper_bound(a,multiply(b,a)))=multiply(inverse(a),multiply(b,a))),
% 0.13/0.45    inference(backward_demodulation,[status(thm)],[f161,f34])).
% 0.13/0.45  fof(f200,plain,(
% 0.13/0.45    ![X0,X1]: (multiply(least_upper_bound(identity,X0),X1)=least_upper_bound(X1,multiply(X0,X1)))),
% 0.13/0.45    inference(paramodulation,[status(thm)],[f18,f31])).
% 0.13/0.45  fof(f219,plain,(
% 0.13/0.45    ~multiply(inverse(a),multiply(least_upper_bound(identity,b),a))=multiply(inverse(a),multiply(b,a))),
% 0.13/0.45    inference(backward_demodulation,[status(thm)],[f200,f182])).
% 0.13/0.45  fof(f237,plain,(
% 0.13/0.45    ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X1,X0))=X0)),
% 0.13/0.45    inference(paramodulation,[status(thm)],[f21,f27])).
% 0.13/0.45  fof(f243,plain,(
% 0.13/0.45    least_upper_bound(b,identity)=b),
% 0.13/0.45    inference(paramodulation,[status(thm)],[f33,f237])).
% 0.13/0.45  fof(f255,plain,(
% 0.13/0.45    ~multiply(inverse(a),multiply(b,a))=multiply(inverse(a),multiply(b,a))),
% 0.13/0.45    inference(backward_demodulation,[status(thm)],[f256,f219])).
% 0.13/0.45  fof(f256,plain,(
% 0.13/0.45    least_upper_bound(identity,b)=b),
% 0.13/0.45    inference(forward_demodulation,[status(thm)],[f22,f243])).
% 0.13/0.45  fof(f261,plain,(
% 0.13/0.45    $false),
% 0.13/0.45    inference(trivial_equality_resolution,[status(thm)],[f255])).
% 0.13/0.46  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.47  % Elapsed time: 0.096160 seconds
% 0.13/0.47  % CPU time: 0.582469 seconds
% 0.13/0.47  % Total memory used: 19.607 MB
% 0.13/0.47  % Net memory used: 19.360 MB
%------------------------------------------------------------------------------