↑ 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  : GRP159-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 : n004.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:07 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.53s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP159-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.52  % Computer : n004.cluster.edu
% 0.11/0.52  % Model    : x86_64 x86_64
% 0.11/0.52  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.52  % Memory   : 8046.5625MB
% 0.11/0.52  % OS       : Linux 6.8.0-71-generic
% 0.11/0.52  % CPULimit : 300
% 0.11/0.52  % WCLimit  : 300
% 0.11/0.52  % DateTime : Sun Sep 20 20:02:34 UTC 2026
% 0.11/0.52  % CPUTime  : 
% 0.11/0.53  % Drodi V4.1.1
% 0.11/0.53  % Refutation found
% 0.11/0.53  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.53  % SZS output start CNFRefutation for theBenchmark
% 0.11/0.53  fof(f4,axiom,(
% 0.11/0.53    (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.11/0.53    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.53  fof(f5,axiom,(
% 0.11/0.53    (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.11/0.53    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.53  fof(f10,axiom,(
% 0.11/0.53    (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.11/0.53    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.53  fof(f12,axiom,(
% 0.11/0.53    (![X,Y,Z]: (multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ))),
% 0.11/0.53    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.53  fof(f16,hypothesis,(
% 0.11/0.53    greatest_lower_bound(a,b) = a ),
% 0.11/0.53    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.53  fof(f17,negated_conjecture,(
% 0.11/0.53    least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b) ),
% 0.11/0.53    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.53  fof(f21,plain,(
% 0.11/0.53    ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.11/0.53    inference(cnf_transformation,[status(thm)],[f4])).
% 0.11/0.53  fof(f22,plain,(
% 0.11/0.53    ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.11/0.53    inference(cnf_transformation,[status(thm)],[f5])).
% 0.11/0.53  fof(f27,plain,(
% 0.11/0.53    ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.11/0.53    inference(cnf_transformation,[status(thm)],[f10])).
% 0.11/0.53  fof(f29,plain,(
% 0.11/0.53    ![X0,X1,X2]: (multiply(X0,least_upper_bound(X1,X2))=least_upper_bound(multiply(X0,X1),multiply(X0,X2)))),
% 0.11/0.53    inference(cnf_transformation,[status(thm)],[f12])).
% 0.11/0.53  fof(f33,plain,(
% 0.11/0.53    greatest_lower_bound(a,b)=a),
% 0.11/0.53    inference(cnf_transformation,[status(thm)],[f16])).
% 0.11/0.53  fof(f34,plain,(
% 0.11/0.53    ~least_upper_bound(multiply(c,a),multiply(c,b))=multiply(c,b)),
% 0.11/0.53    inference(cnf_transformation,[status(thm)],[f17])).
% 0.11/0.53  fof(f39,plain,(
% 0.11/0.53    ~multiply(c,least_upper_bound(a,b))=multiply(c,b)),
% 0.11/0.53    inference(forward_demodulation,[status(thm)],[f29,f34])).
% 0.11/0.53  fof(f47,plain,(
% 0.11/0.53    ~multiply(c,least_upper_bound(b,a))=multiply(c,b)),
% 0.11/0.53    inference(paramodulation,[status(thm)],[f22,f39])).
% 0.11/0.53  fof(f70,plain,(
% 0.11/0.53    ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X1,X0))=X0)),
% 0.11/0.53    inference(paramodulation,[status(thm)],[f21,f27])).
% 0.11/0.53  fof(f127,plain,(
% 0.11/0.53    least_upper_bound(b,a)=b),
% 0.11/0.53    inference(paramodulation,[status(thm)],[f33,f70])).
% 0.11/0.53  fof(f137,plain,(
% 0.11/0.53    ~multiply(c,b)=multiply(c,b)),
% 0.11/0.53    inference(backward_demodulation,[status(thm)],[f127,f47])).
% 0.11/0.53  fof(f140,plain,(
% 0.11/0.53    $false),
% 0.11/0.53    inference(trivial_equality_resolution,[status(thm)],[f137])).
% 0.11/0.53  % SZS output end CNFRefutation for theBenchmark.p
% 0.11/0.57  % Elapsed time: 0.044809 seconds
% 0.11/0.57  % CPU time: 0.051576 seconds
% 0.11/0.57  % Total memory used: 2.116 MB
% 0.11/0.57  % Net memory used: 2.109 MB
%------------------------------------------------------------------------------