↑ 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  : GRP193-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:14 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP193-2 : 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.10/0.35  % Computer : n002.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sun Sep 20 20:08:17 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.14/0.36  % Drodi V4.1.1
% 0.14/0.37  % Refutation found
% 0.14/0.37  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.37  % SZS output start CNFRefutation for theBenchmark
% 0.14/0.37  fof(f1,axiom,(
% 0.14/0.37    (![X]: (multiply(identity,X) = X ))),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f4,axiom,(
% 0.14/0.37    (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f6,axiom,(
% 0.14/0.37    (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f9,axiom,(
% 0.14/0.37    (![X]: (greatest_lower_bound(X,X) = X ))),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f15,axiom,(
% 0.14/0.37    (![Y,Z,X]: (multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ))),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f17,hypothesis,(
% 0.14/0.37    greatest_lower_bound(identity,b) = identity ),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f19,hypothesis,(
% 0.14/0.37    greatest_lower_bound(a,b) = identity ),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f20,hypothesis,(
% 0.14/0.37    greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)) ),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f21,negated_conjecture,(
% 0.14/0.37    greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c) ),
% 0.14/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.37  fof(f22,plain,(
% 0.14/0.37    ![X0]: (multiply(identity,X0)=X0)),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f1])).
% 0.14/0.37  fof(f25,plain,(
% 0.14/0.37    ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f4])).
% 0.14/0.37  fof(f27,plain,(
% 0.14/0.37    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f6])).
% 0.14/0.37  fof(f30,plain,(
% 0.14/0.37    ![X0]: (greatest_lower_bound(X0,X0)=X0)),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f9])).
% 0.14/0.37  fof(f36,plain,(
% 0.14/0.37    ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)))),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f15])).
% 0.14/0.37  fof(f38,plain,(
% 0.14/0.37    greatest_lower_bound(identity,b)=identity),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f17])).
% 0.14/0.37  fof(f40,plain,(
% 0.14/0.37    greatest_lower_bound(a,b)=identity),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f19])).
% 0.14/0.37  fof(f41,plain,(
% 0.14/0.37    greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)))=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f20])).
% 0.14/0.37  fof(f42,plain,(
% 0.14/0.37    ~greatest_lower_bound(a,multiply(b,c))=greatest_lower_bound(a,c)),
% 0.14/0.37    inference(cnf_transformation,[status(thm)],[f21])).
% 0.14/0.37  fof(f47,plain,(
% 0.14/0.37    greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))))=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f27,f41])).
% 0.14/0.37  fof(f48,plain,(
% 0.14/0.37    greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(identity,greatest_lower_bound(a,c))))=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f40,f47])).
% 0.14/0.37  fof(f49,plain,(
% 0.14/0.37    greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c)))=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f22,f48])).
% 0.14/0.37  fof(f61,plain,(
% 0.14/0.37    ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X0,X1)))=greatest_lower_bound(X0,X1))),
% 0.14/0.37    inference(paramodulation,[status(thm)],[f30,f27])).
% 0.14/0.37  fof(f66,plain,(
% 0.14/0.37    ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X0,X1))=greatest_lower_bound(X0,X1))),
% 0.14/0.37    inference(paramodulation,[status(thm)],[f30,f27])).
% 0.14/0.37  fof(f102,plain,(
% 0.14/0.37    greatest_lower_bound(b,identity)=identity),
% 0.14/0.37    inference(paramodulation,[status(thm)],[f25,f38])).
% 0.14/0.37  fof(f107,plain,(
% 0.14/0.37    ![X0,X1]: (multiply(greatest_lower_bound(X0,identity),X1)=greatest_lower_bound(multiply(X0,X1),X1))),
% 0.14/0.37    inference(paramodulation,[status(thm)],[f22,f36])).
% 0.14/0.37  fof(f212,plain,(
% 0.14/0.37    greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(c,a)))=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(paramodulation,[status(thm)],[f25,f49])).
% 0.14/0.37  fof(f223,plain,(
% 0.14/0.37    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(greatest_lower_bound(X0,X1),X2))))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.14/0.37    inference(paramodulation,[status(thm)],[f27,f61])).
% 0.14/0.37  fof(f238,plain,(
% 0.14/0.37    ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X1,X0)))=greatest_lower_bound(X0,X1))),
% 0.14/0.37    inference(paramodulation,[status(thm)],[f25,f61])).
% 0.14/0.37  fof(f240,plain,(
% 0.14/0.37    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(greatest_lower_bound(X0,X1),X2))))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.14/0.37    inference(paramodulation,[status(thm)],[f61,f27])).
% 0.14/0.37  fof(f243,plain,(
% 0.14/0.37    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X0,greatest_lower_bound(X1,X2)))))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f27,f223])).
% 0.14/0.37  fof(f244,plain,(
% 0.14/0.37    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X0,greatest_lower_bound(X1,X2)))))=greatest_lower_bound(X0,greatest_lower_bound(X1,X2)))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f27,f243])).
% 0.14/0.37  fof(f275,plain,(
% 0.14/0.37    ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X0))=greatest_lower_bound(X0,X1))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f66,f238])).
% 0.14/0.37  fof(f277,plain,(
% 0.14/0.37    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X0,X1))))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f275,f240])).
% 0.14/0.37  fof(f278,plain,(
% 0.14/0.37    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0)))=greatest_lower_bound(X0,greatest_lower_bound(X1,X2)))),
% 0.14/0.37    inference(backward_demodulation,[status(thm)],[f279,f244])).
% 0.14/0.37  fof(f279,plain,(
% 0.14/0.37    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X0,X1))))=greatest_lower_bound(X0,greatest_lower_bound(X1,X2)))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f27,f277])).
% 0.14/0.37  fof(f283,plain,(
% 0.14/0.37    greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),c))=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(backward_demodulation,[status(thm)],[f278,f212])).
% 0.14/0.37  fof(f285,plain,(
% 0.14/0.37    greatest_lower_bound(a,multiply(greatest_lower_bound(b,identity),c))=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f107,f283])).
% 0.14/0.37  fof(f286,plain,(
% 0.14/0.37    greatest_lower_bound(a,multiply(identity,c))=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f102,f285])).
% 0.14/0.37  fof(f287,plain,(
% 0.14/0.37    greatest_lower_bound(a,c)=greatest_lower_bound(a,multiply(b,c))),
% 0.14/0.37    inference(forward_demodulation,[status(thm)],[f22,f286])).
% 0.14/0.37  fof(f288,plain,(
% 0.14/0.37    $false),
% 0.14/0.37    inference(forward_subsumption_resolution,[status(thm)],[f287,f42])).
% 0.14/0.37  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.39  % Elapsed time: 0.028667 seconds
% 0.14/0.39  % CPU time: 0.072334 seconds
% 0.14/0.39  % Total memory used: 3.783 MB
% 0.14/0.39  % Net memory used: 3.766 MB
%------------------------------------------------------------------------------