↑ 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  : GRP165-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:08 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP165-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.36  % Computer : n004.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 20 20:02:49 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.37  % Drodi V4.1.1
% 0.15/0.40  % Refutation found
% 0.15/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.15/0.40  fof(f1,axiom,(
% 0.15/0.40    (![X]: (multiply(identity,X) = X ))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.40  fof(f2,axiom,(
% 0.15/0.40    (![X]: (multiply(inverse(X),X) = identity ))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.40  fof(f3,axiom,(
% 0.15/0.40    (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.40  fof(f5,axiom,(
% 0.15/0.40    (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.40  fof(f12,axiom,(
% 0.15/0.40    (![X,Y,Z]: (multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.40  fof(f16,hypothesis,(
% 0.15/0.40    least_upper_bound(a,identity) = a ),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.40  fof(f17,negated_conjecture,(
% 0.15/0.40    least_upper_bound(a,multiply(a,a)) != multiply(a,a) ),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.40  fof(f18,plain,(
% 0.15/0.40    ![X0]: (multiply(identity,X0)=X0)),
% 0.15/0.40    inference(cnf_transformation,[status(thm)],[f1])).
% 0.15/0.40  fof(f19,plain,(
% 0.15/0.40    ![X0]: (multiply(inverse(X0),X0)=identity)),
% 0.15/0.40    inference(cnf_transformation,[status(thm)],[f2])).
% 0.15/0.40  fof(f20,plain,(
% 0.15/0.40    ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 0.15/0.40    inference(cnf_transformation,[status(thm)],[f3])).
% 0.15/0.40  fof(f22,plain,(
% 0.15/0.40    ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.15/0.40    inference(cnf_transformation,[status(thm)],[f5])).
% 0.15/0.40  fof(f29,plain,(
% 0.15/0.40    ![X0,X1,X2]: (multiply(X0,least_upper_bound(X1,X2))=least_upper_bound(multiply(X0,X1),multiply(X0,X2)))),
% 0.15/0.40    inference(cnf_transformation,[status(thm)],[f12])).
% 0.15/0.40  fof(f33,plain,(
% 0.15/0.40    least_upper_bound(a,identity)=a),
% 0.15/0.40    inference(cnf_transformation,[status(thm)],[f16])).
% 0.15/0.40  fof(f34,plain,(
% 0.15/0.40    ~least_upper_bound(a,multiply(a,a))=multiply(a,a)),
% 0.15/0.40    inference(cnf_transformation,[status(thm)],[f17])).
% 0.15/0.40  fof(f35,definition,(
% 0.15/0.40    sF1_fnc=multiply(a,a)),
% 0.15/0.40    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.15/0.40  fof(f36,definition,(
% 0.15/0.40    sF0_fnc=least_upper_bound(a,sF1_fnc)),
% 0.15/0.40    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.15/0.40  fof(f37,plain,(
% 0.15/0.40    ~sF0_fnc=sF1_fnc),
% 0.15/0.40    inference(definition_folding,[],[f34,f36,f35])).
% 0.15/0.40  fof(f47,plain,(
% 0.15/0.40    ![X0,X1]: (multiply(identity,X0)=multiply(inverse(X1),multiply(X1,X0)))),
% 0.15/0.40    inference(paramodulation,[status(thm)],[f19,f20])).
% 0.15/0.40  fof(f48,plain,(
% 0.15/0.40    ![X0,X1]: (X0=multiply(inverse(X1),multiply(X1,X0)))),
% 0.15/0.40    inference(forward_demodulation,[status(thm)],[f18,f47])).
% 0.15/0.40  fof(f91,plain,(
% 0.15/0.40    ![X0,X1]: (multiply(X0,X1)=multiply(inverse(inverse(X0)),X1))),
% 0.15/0.40    inference(paramodulation,[status(thm)],[f48,f48])).
% 0.15/0.40  fof(f92,plain,(
% 0.15/0.40    ![X0]: (X0=multiply(inverse(inverse(X0)),identity))),
% 0.15/0.40    inference(paramodulation,[status(thm)],[f19,f48])).
% 0.15/0.40  fof(f98,plain,(
% 0.15/0.40    ![X0]: (X0=multiply(X0,identity))),
% 0.15/0.40    inference(forward_demodulation,[status(thm)],[f91,f92])).
% 0.15/0.40  fof(f108,plain,(
% 0.15/0.40    ![X0]: (multiply(a,least_upper_bound(a,X0))=least_upper_bound(sF1_fnc,multiply(a,X0)))),
% 0.15/0.40    inference(paramodulation,[status(thm)],[f35,f29])).
% 0.15/0.40  fof(f240,plain,(
% 0.15/0.40    multiply(a,least_upper_bound(a,identity))=least_upper_bound(sF1_fnc,a)),
% 0.15/0.40    inference(paramodulation,[status(thm)],[f98,f108])).
% 0.15/0.40  fof(f248,plain,(
% 0.15/0.40    multiply(a,a)=least_upper_bound(sF1_fnc,a)),
% 0.15/0.40    inference(forward_demodulation,[status(thm)],[f33,f240])).
% 0.15/0.40  fof(f249,plain,(
% 0.15/0.40    sF1_fnc=least_upper_bound(sF1_fnc,a)),
% 0.15/0.40    inference(forward_demodulation,[status(thm)],[f35,f248])).
% 0.15/0.40  fof(f398,plain,(
% 0.15/0.40    sF1_fnc=least_upper_bound(a,sF1_fnc)),
% 0.15/0.40    inference(paramodulation,[status(thm)],[f22,f249])).
% 0.15/0.40  fof(f408,plain,(
% 0.15/0.40    sF1_fnc=sF0_fnc),
% 0.15/0.40    inference(forward_demodulation,[status(thm)],[f36,f398])).
% 0.15/0.40  fof(f409,plain,(
% 0.15/0.40    $false),
% 0.15/0.40    inference(forward_subsumption_resolution,[status(thm)],[f408,f37])).
% 0.15/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.41  % Elapsed time: 0.037129 seconds
% 0.15/0.41  % CPU time: 0.130837 seconds
% 0.15/0.41  % Total memory used: 5.069 MB
% 0.15/0.41  % Net memory used: 5.011 MB
%------------------------------------------------------------------------------