↑ 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  : GRP166-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 : n014.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:08 PM UTC 2026

% Result   : Unsatisfiable 0.08s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP166-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34  % Computer : n014.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sun Sep 20 20:02:49 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.35  % Drodi V4.1.1
% 0.08/0.38  % Refutation found
% 0.08/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.08/0.38  % SZS output start CNFRefutation for theBenchmark
% 0.08/0.38  fof(f1,axiom,(
% 0.08/0.38    (![X]: (multiply(identity,X) = X ))),
% 0.08/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.08/0.38  fof(f2,axiom,(
% 0.08/0.38    (![X]: (multiply(inverse(X),X) = identity ))),
% 0.08/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.08/0.38  fof(f3,axiom,(
% 0.08/0.38    (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 0.08/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.08/0.38  fof(f5,axiom,(
% 0.08/0.38    (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.08/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.08/0.38  fof(f12,axiom,(
% 0.08/0.38    (![X,Y,Z]: (multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ))),
% 0.08/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.08/0.38  fof(f17,hypothesis,(
% 0.08/0.38    least_upper_bound(b,identity) = b ),
% 0.08/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.08/0.38  fof(f18,negated_conjecture,(
% 0.08/0.38    least_upper_bound(a,multiply(a,b)) != multiply(a,b) ),
% 0.08/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.08/0.38  fof(f19,plain,(
% 0.08/0.38    ![X0]: (multiply(identity,X0)=X0)),
% 0.08/0.38    inference(cnf_transformation,[status(thm)],[f1])).
% 0.08/0.38  fof(f20,plain,(
% 0.08/0.38    ![X0]: (multiply(inverse(X0),X0)=identity)),
% 0.08/0.38    inference(cnf_transformation,[status(thm)],[f2])).
% 0.08/0.38  fof(f21,plain,(
% 0.08/0.38    ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 0.08/0.38    inference(cnf_transformation,[status(thm)],[f3])).
% 0.08/0.38  fof(f23,plain,(
% 0.08/0.38    ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.08/0.38    inference(cnf_transformation,[status(thm)],[f5])).
% 0.08/0.38  fof(f30,plain,(
% 0.08/0.38    ![X0,X1,X2]: (multiply(X0,least_upper_bound(X1,X2))=least_upper_bound(multiply(X0,X1),multiply(X0,X2)))),
% 0.08/0.38    inference(cnf_transformation,[status(thm)],[f12])).
% 0.08/0.38  fof(f35,plain,(
% 0.08/0.38    least_upper_bound(b,identity)=b),
% 0.08/0.38    inference(cnf_transformation,[status(thm)],[f17])).
% 0.08/0.38  fof(f36,plain,(
% 0.08/0.38    ~least_upper_bound(a,multiply(a,b))=multiply(a,b)),
% 0.08/0.38    inference(cnf_transformation,[status(thm)],[f18])).
% 0.08/0.38  fof(f49,plain,(
% 0.08/0.38    ![X0,X1]: (multiply(identity,X0)=multiply(inverse(X1),multiply(X1,X0)))),
% 0.08/0.38    inference(paramodulation,[status(thm)],[f20,f21])).
% 0.08/0.38  fof(f53,plain,(
% 0.08/0.38    ![X0,X1]: (X0=multiply(inverse(X1),multiply(X1,X0)))),
% 0.08/0.38    inference(forward_demodulation,[status(thm)],[f19,f49])).
% 0.08/0.38  fof(f67,plain,(
% 0.08/0.38    least_upper_bound(identity,b)=b),
% 0.08/0.38    inference(paramodulation,[status(thm)],[f23,f35])).
% 0.08/0.38  fof(f127,plain,(
% 0.08/0.38    ![X0,X1]: (multiply(X0,X1)=multiply(inverse(inverse(X0)),X1))),
% 0.08/0.38    inference(paramodulation,[status(thm)],[f53,f53])).
% 0.08/0.38  fof(f128,plain,(
% 0.08/0.38    ![X0]: (X0=multiply(inverse(inverse(X0)),identity))),
% 0.08/0.38    inference(paramodulation,[status(thm)],[f20,f53])).
% 0.08/0.38  fof(f131,plain,(
% 0.08/0.38    ![X0]: (X0=multiply(X0,identity))),
% 0.08/0.38    inference(forward_demodulation,[status(thm)],[f127,f128])).
% 0.08/0.38  fof(f338,plain,(
% 0.08/0.38    ![X0,X1]: (multiply(X0,least_upper_bound(identity,X1))=least_upper_bound(X0,multiply(X0,X1)))),
% 0.08/0.38    inference(paramodulation,[status(thm)],[f131,f30])).
% 0.08/0.38  fof(f356,plain,(
% 0.08/0.38    ~multiply(a,least_upper_bound(identity,b))=multiply(a,b)),
% 0.08/0.38    inference(backward_demodulation,[status(thm)],[f338,f36])).
% 0.08/0.39  fof(f367,plain,(
% 0.08/0.39    ~multiply(a,b)=multiply(a,b)),
% 0.08/0.39    inference(forward_demodulation,[status(thm)],[f67,f356])).
% 0.08/0.39  fof(f368,plain,(
% 0.08/0.39    $false),
% 0.08/0.39    inference(trivial_equality_resolution,[status(thm)],[f367])).
% 0.08/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.08/0.44  % Elapsed time: 0.084017 seconds
% 0.08/0.44  % CPU time: 0.207568 seconds
% 0.08/0.44  % Total memory used: 5.855 MB
% 0.08/0.44  % Net memory used: 5.811 MB
%------------------------------------------------------------------------------