↑ 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-2 : 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 : n002.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.65s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP175-2 : 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.55  % Computer : n002.cluster.edu
% 0.09/0.55  % Model    : x86_64 x86_64
% 0.09/0.55  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55  % Memory   : 8046.5625MB
% 0.09/0.55  % OS       : Linux 6.8.0-71-generic
% 0.09/0.55  % CPULimit : 300
% 0.09/0.55  % WCLimit  : 300
% 0.09/0.55  % DateTime : Sun Sep 20 20:06:48 UTC 2026
% 0.09/0.56  % CPUTime  : 
% 0.13/0.56  % Drodi V4.1.1
% 0.13/0.65  % Refutation found
% 0.13/0.65  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.65  % SZS output start CNFRefutation for theBenchmark
% 0.13/0.65  fof(f1,axiom,(
% 0.13/0.65    (![X]: (multiply(identity,X) = X ))),
% 0.13/0.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.65  fof(f2,axiom,(
% 0.13/0.65    (![X]: (multiply(inverse(X),X) = identity ))),
% 0.13/0.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.65  fof(f13,axiom,(
% 0.13/0.65    (![X,Y,Z]: (multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ))),
% 0.13/0.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.65  fof(f15,axiom,(
% 0.13/0.65    (![Y,Z,X]: (multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ))),
% 0.13/0.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.65  fof(f16,hypothesis,(
% 0.13/0.65    greatest_lower_bound(identity,b) = identity ),
% 0.13/0.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.65  fof(f17,negated_conjecture,(
% 0.13/0.65    greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity ),
% 0.13/0.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.65  fof(f18,plain,(
% 0.13/0.65    ![X0]: (multiply(identity,X0)=X0)),
% 0.13/0.65    inference(cnf_transformation,[status(thm)],[f1])).
% 0.13/0.65  fof(f19,plain,(
% 0.13/0.65    ![X0]: (multiply(inverse(X0),X0)=identity)),
% 0.13/0.65    inference(cnf_transformation,[status(thm)],[f2])).
% 0.13/0.65  fof(f30,plain,(
% 0.13/0.65    ![X0,X1,X2]: (multiply(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)))),
% 0.13/0.65    inference(cnf_transformation,[status(thm)],[f13])).
% 0.13/0.65  fof(f32,plain,(
% 0.13/0.65    ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)))),
% 0.13/0.65    inference(cnf_transformation,[status(thm)],[f15])).
% 0.13/0.65  fof(f33,plain,(
% 0.13/0.65    greatest_lower_bound(identity,b)=identity),
% 0.13/0.65    inference(cnf_transformation,[status(thm)],[f16])).
% 0.13/0.65  fof(f34,plain,(
% 0.13/0.65    ~greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a)))=identity),
% 0.13/0.65    inference(cnf_transformation,[status(thm)],[f17])).
% 0.13/0.65  fof(f234,plain,(
% 0.13/0.65    ![X0,X1]: (multiply(inverse(X0),greatest_lower_bound(X0,X1))=greatest_lower_bound(identity,multiply(inverse(X0),X1)))),
% 0.13/0.65    inference(paramodulation,[status(thm)],[f19,f30])).
% 0.13/0.65  fof(f256,plain,(
% 0.13/0.65    ~multiply(inverse(a),greatest_lower_bound(a,multiply(b,a)))=identity),
% 0.13/0.65    inference(backward_demodulation,[status(thm)],[f234,f34])).
% 0.13/0.65  fof(f276,plain,(
% 0.13/0.65    ![X0,X1]: (multiply(greatest_lower_bound(identity,X0),X1)=greatest_lower_bound(X1,multiply(X0,X1)))),
% 0.13/0.65    inference(paramodulation,[status(thm)],[f18,f32])).
% 0.13/0.65  fof(f296,plain,(
% 0.13/0.65    ~multiply(inverse(a),multiply(greatest_lower_bound(identity,b),a))=identity),
% 0.13/0.65    inference(backward_demodulation,[status(thm)],[f276,f256])).
% 0.13/0.65  fof(f309,plain,(
% 0.13/0.65    ~multiply(inverse(a),multiply(identity,a))=identity),
% 0.13/0.65    inference(forward_demodulation,[status(thm)],[f33,f296])).
% 0.13/0.65  fof(f310,plain,(
% 0.13/0.65    ~multiply(inverse(a),a)=identity),
% 0.13/0.65    inference(forward_demodulation,[status(thm)],[f18,f309])).
% 0.13/0.65  fof(f311,plain,(
% 0.13/0.65    ~identity=identity),
% 0.13/0.65    inference(forward_demodulation,[status(thm)],[f19,f310])).
% 0.13/0.65  fof(f312,plain,(
% 0.13/0.65    $false),
% 0.13/0.65    inference(trivial_equality_resolution,[status(thm)],[f311])).
% 0.13/0.65  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.66  % Elapsed time: 0.092119 seconds
% 0.13/0.66  % CPU time: 0.593238 seconds
% 0.13/0.66  % Total memory used: 21.137 MB
% 0.13/0.66  % Net memory used: 20.924 MB
%------------------------------------------------------------------------------