↑ 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  : GRP185-4 : 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 : n015.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:13 PM UTC 2026

% Result   : Unsatisfiable 69.07s 15.57s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP185-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.07  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n015.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sun Sep 20 20:08:36 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  % Drodi V4.1.1
% 69.07/15.57  % Refutation found
% 69.07/15.57  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 69.07/15.57  % SZS output start CNFRefutation for theBenchmark
% 69.07/15.57  fof(f1,axiom,(
% 69.07/15.57    (![X]: (multiply(identity,X) = X ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f2,axiom,(
% 69.07/15.57    (![X]: (multiply(inverse(X),X) = identity ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f3,axiom,(
% 69.07/15.57    (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f4,axiom,(
% 69.07/15.57    (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f5,axiom,(
% 69.07/15.57    (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f6,axiom,(
% 69.07/15.57    (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f7,axiom,(
% 69.07/15.57    (![X,Y,Z]: (least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f8,axiom,(
% 69.07/15.57    (![X]: (least_upper_bound(X,X) = X ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f9,axiom,(
% 69.07/15.57    (![X]: (greatest_lower_bound(X,X) = X ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f10,axiom,(
% 69.07/15.57    (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f11,axiom,(
% 69.07/15.57    (![X,Y]: (greatest_lower_bound(X,least_upper_bound(X,Y)) = X ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f12,axiom,(
% 69.07/15.57    (![X,Y,Z]: (multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f14,axiom,(
% 69.07/15.57    (![Y,Z,X]: (multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f17,hypothesis,(
% 69.07/15.57    (![X]: (inverse(inverse(X)) = X ))),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f19,negated_conjecture,(
% 69.07/15.57    greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity) ),
% 69.07/15.57    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 69.07/15.57  fof(f20,plain,(
% 69.07/15.57    ![X0]: (multiply(identity,X0)=X0)),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f1])).
% 69.07/15.57  fof(f21,plain,(
% 69.07/15.57    ![X0]: (multiply(inverse(X0),X0)=identity)),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f2])).
% 69.07/15.57  fof(f22,plain,(
% 69.07/15.57    ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f3])).
% 69.07/15.57  fof(f23,plain,(
% 69.07/15.57    ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f4])).
% 69.07/15.57  fof(f24,plain,(
% 69.07/15.57    ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f5])).
% 69.07/15.57  fof(f25,plain,(
% 69.07/15.57    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f6])).
% 69.07/15.57  fof(f26,plain,(
% 69.07/15.57    ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(least_upper_bound(X0,X1),X2))),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f7])).
% 69.07/15.57  fof(f27,plain,(
% 69.07/15.57    ![X0]: (least_upper_bound(X0,X0)=X0)),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f8])).
% 69.07/15.57  fof(f28,plain,(
% 69.07/15.57    ![X0]: (greatest_lower_bound(X0,X0)=X0)),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f9])).
% 69.07/15.57  fof(f29,plain,(
% 69.07/15.57    ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f10])).
% 69.07/15.57  fof(f30,plain,(
% 69.07/15.57    ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X0,X1))=X0)),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f11])).
% 69.07/15.57  fof(f31,plain,(
% 69.07/15.57    ![X0,X1,X2]: (multiply(X0,least_upper_bound(X1,X2))=least_upper_bound(multiply(X0,X1),multiply(X0,X2)))),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f12])).
% 69.07/15.57  fof(f33,plain,(
% 69.07/15.57    ![X0,X1,X2]: (multiply(least_upper_bound(X0,X1),X2)=least_upper_bound(multiply(X0,X2),multiply(X1,X2)))),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f14])).
% 69.07/15.57  fof(f36,plain,(
% 69.07/15.57    ![X0]: (inverse(inverse(X0))=X0)),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f17])).
% 69.07/15.57  fof(f38,plain,(
% 69.07/15.57    ~greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)))=least_upper_bound(multiply(a,b),identity)),
% 69.07/15.57    inference(cnf_transformation,[status(thm)],[f19])).
% 69.07/15.57  fof(f39,definition,(
% 69.07/15.57    sF2_fnc=multiply(a,b)),
% 69.07/15.57    introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition])).
% 69.07/15.57  fof(f40,definition,(
% 69.07/15.57    sF1_fnc=least_upper_bound(sF2_fnc,identity)),
% 69.07/15.57    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 69.07/15.57  fof(f41,definition,(
% 69.07/15.57    sF4_fnc=least_upper_bound(a,identity)),
% 69.07/15.57    introduced(definition,[new_symbols(definition,[sF4_fnc])],[function_definition])).
% 69.07/15.57  fof(f42,definition,(
% 69.07/15.57    sF5_fnc=least_upper_bound(b,identity)),
% 69.07/15.57    introduced(definition,[new_symbols(definition,[sF5_fnc])],[function_definition])).
% 69.07/15.57  fof(f43,definition,(
% 69.07/15.57    sF3_fnc=multiply(sF4_fnc,sF5_fnc)),
% 69.07/15.57    introduced(definition,[new_symbols(definition,[sF3_fnc])],[function_definition])).
% 69.07/15.57  fof(f44,definition,(
% 69.07/15.57    sF0_fnc=greatest_lower_bound(sF1_fnc,sF3_fnc)),
% 69.07/15.57    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 69.07/15.57  fof(f45,definition,(
% 69.07/15.57    sF6_fnc=least_upper_bound(sF2_fnc,identity)),
% 69.07/15.57    introduced(definition,[new_symbols(definition,[sF6_fnc])],[function_definition])).
% 69.07/15.57  fof(f46,plain,(
% 69.07/15.57    ~sF0_fnc=sF6_fnc),
% 69.07/15.57    inference(definition_folding,[],[f38,f45,f44,f43,f42,f41,f40,f39])).
% 69.07/15.57  fof(f47,plain,(
% 69.07/15.57    sF6_fnc=sF1_fnc),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f40,f45])).
% 69.07/15.57  fof(f48,plain,(
% 69.07/15.57    ~sF0_fnc=sF1_fnc),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f47,f46])).
% 69.07/15.57  fof(f61,plain,(
% 69.07/15.57    ![X0]: (multiply(X0,inverse(X0))=identity)),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f36,f21])).
% 69.07/15.57  fof(f63,plain,(
% 69.07/15.57    ![X0,X1]: (multiply(identity,X0)=multiply(inverse(X1),multiply(X1,X0)))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f21,f22])).
% 69.07/15.57  fof(f64,plain,(
% 69.07/15.57    ![X0,X1]: (X0=multiply(inverse(X1),multiply(X1,X0)))),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f20,f63])).
% 69.07/15.57  fof(f73,plain,(
% 69.07/15.57    ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(X2,greatest_lower_bound(X0,X1)))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f23,f25])).
% 69.07/15.57  fof(f79,plain,(
% 69.07/15.57    ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X0,X1))=greatest_lower_bound(X0,X1))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f28,f25])).
% 69.07/15.57  fof(f85,plain,(
% 69.07/15.57    ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(X2,least_upper_bound(X0,X1)))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f24,f26])).
% 69.07/15.57  fof(f89,plain,(
% 69.07/15.57    ![X0]: (least_upper_bound(b,least_upper_bound(identity,X0))=least_upper_bound(sF5_fnc,X0))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f42,f26])).
% 69.07/15.57  fof(f90,plain,(
% 69.07/15.57    ![X0]: (least_upper_bound(a,least_upper_bound(identity,X0))=least_upper_bound(sF4_fnc,X0))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f41,f26])).
% 69.07/15.57  fof(f91,plain,(
% 69.07/15.57    ![X0]: (least_upper_bound(sF2_fnc,least_upper_bound(identity,X0))=least_upper_bound(sF1_fnc,X0))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f40,f26])).
% 69.07/15.57  fof(f105,plain,(
% 69.07/15.57    ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,greatest_lower_bound(least_upper_bound(X0,X1),X2)))=least_upper_bound(X0,X1))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f26,f29])).
% 69.07/15.57  fof(f108,plain,(
% 69.07/15.57    ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X1,X0))=X0)),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f23,f29])).
% 69.07/15.57  fof(f135,plain,(
% 69.07/15.57    greatest_lower_bound(a,sF4_fnc)=a),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f41,f30])).
% 69.07/15.57  fof(f139,plain,(
% 69.07/15.57    ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X1,X0))=X0)),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f24,f30])).
% 69.07/15.57  fof(f151,plain,(
% 69.07/15.57    ![X0,X1]: (multiply(inverse(X0),least_upper_bound(X0,X1))=least_upper_bound(identity,multiply(inverse(X0),X1)))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f21,f31])).
% 69.07/15.57  fof(f152,plain,(
% 69.07/15.57    ![X0]: (multiply(sF4_fnc,least_upper_bound(sF5_fnc,X0))=least_upper_bound(sF3_fnc,multiply(sF4_fnc,X0)))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f43,f31])).
% 69.07/15.57  fof(f156,plain,(
% 69.07/15.57    ![X0]: (multiply(a,least_upper_bound(b,X0))=least_upper_bound(sF2_fnc,multiply(a,X0)))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f39,f31])).
% 69.07/15.57  fof(f236,plain,(
% 69.07/15.57    ![X0]: (multiply(least_upper_bound(sF4_fnc,X0),sF5_fnc)=least_upper_bound(sF3_fnc,multiply(X0,sF5_fnc)))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f43,f33])).
% 69.07/15.57  fof(f312,plain,(
% 69.07/15.57    least_upper_bound(sF4_fnc,a)=sF4_fnc),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f135,f108])).
% 69.07/15.57  fof(f326,plain,(
% 69.07/15.57    ![X0]: (X0=multiply(inverse(inverse(X0)),identity))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f21,f64])).
% 69.07/15.57  fof(f343,plain,(
% 69.07/15.57    ![X0]: (X0=multiply(X0,identity))),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f36,f326])).
% 69.07/15.57  fof(f385,plain,(
% 69.07/15.57    ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X0,X1))=greatest_lower_bound(X1,X0))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f28,f73])).
% 69.07/15.57  fof(f582,plain,(
% 69.07/15.57    greatest_lower_bound(sF1_fnc,sF0_fnc)=greatest_lower_bound(sF1_fnc,sF3_fnc)),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f44,f79])).
% 69.07/15.57  fof(f619,plain,(
% 69.07/15.57    greatest_lower_bound(sF1_fnc,sF0_fnc)=sF0_fnc),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f44,f582])).
% 69.07/15.57  fof(f667,plain,(
% 69.07/15.57    least_upper_bound(b,identity)=least_upper_bound(sF5_fnc,identity)),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f27,f89])).
% 69.07/15.57  fof(f672,plain,(
% 69.07/15.57    sF5_fnc=least_upper_bound(sF5_fnc,identity)),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f42,f667])).
% 69.07/15.57  fof(f768,plain,(
% 69.07/15.57    ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X1,X0),X2))=least_upper_bound(X2,X0))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f108,f85])).
% 69.07/15.57  fof(f822,plain,(
% 69.07/15.57    least_upper_bound(a,identity)=least_upper_bound(sF4_fnc,identity)),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f27,f90])).
% 69.07/15.57  fof(f831,plain,(
% 69.07/15.57    sF4_fnc=least_upper_bound(sF4_fnc,identity)),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f41,f822])).
% 69.07/15.57  fof(f1254,plain,(
% 69.07/15.57    greatest_lower_bound(sF1_fnc,sF0_fnc)=greatest_lower_bound(sF3_fnc,sF1_fnc)),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f44,f385])).
% 69.07/15.57  fof(f1262,plain,(
% 69.07/15.57    ![X0,X1]: (greatest_lower_bound(X0,X0)=greatest_lower_bound(least_upper_bound(X0,X1),X0))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f30,f385])).
% 69.07/15.57  fof(f1302,plain,(
% 69.07/15.57    sF0_fnc=greatest_lower_bound(sF3_fnc,sF1_fnc)),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f619,f1254])).
% 69.07/15.57  fof(f1317,plain,(
% 69.07/15.57    ![X0,X1]: (X0=greatest_lower_bound(least_upper_bound(X0,X1),X0))),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f28,f1262])).
% 69.07/15.57  fof(f1411,plain,(
% 69.07/15.57    ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X1,X0),greatest_lower_bound(X0,X2)))=least_upper_bound(X0,greatest_lower_bound(X1,X0)))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f108,f105])).
% 69.07/15.57  fof(f1514,plain,(
% 69.07/15.57    ![X0,X1,X2]: (least_upper_bound(greatest_lower_bound(X0,X1),X0)=least_upper_bound(X0,greatest_lower_bound(X2,X0)))),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f768,f1411])).
% 69.07/15.57  fof(f1520,plain,(
% 69.07/15.57    ![X0,X1]: (least_upper_bound(greatest_lower_bound(X0,X1),X0)=X0)),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f108,f1514])).
% 69.07/15.57  fof(f2357,plain,(
% 69.07/15.57    multiply(sF4_fnc,sF5_fnc)=least_upper_bound(sF3_fnc,multiply(sF4_fnc,identity))),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f672,f152])).
% 69.07/15.57  fof(f2380,plain,(
% 69.07/15.57    sF3_fnc=least_upper_bound(sF3_fnc,multiply(sF4_fnc,identity))),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f43,f2357])).
% 69.07/15.57  fof(f2381,plain,(
% 69.07/15.57    sF3_fnc=least_upper_bound(sF3_fnc,sF4_fnc)),
% 69.07/15.57    inference(forward_demodulation,[status(thm)],[f343,f2380])).
% 69.07/15.57  fof(f2403,plain,(
% 69.07/15.57    greatest_lower_bound(sF4_fnc,sF3_fnc)=sF4_fnc),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f2381,f139])).
% 69.07/15.57  fof(f2412,plain,(
% 69.07/15.57    greatest_lower_bound(sF3_fnc,sF4_fnc)=sF4_fnc),
% 69.07/15.57    inference(paramodulation,[status(thm)],[f23,f2403])).
% 69.07/15.57  fof(f2437,plain,(
% 69.07/15.57    least_upper_bound(sF4_fnc,sF3_fnc)=sF3_fnc),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f2412,f1520])).
% 69.07/15.58  fof(f3196,plain,(
% 69.07/15.58    multiply(inverse(sF4_fnc),sF4_fnc)=least_upper_bound(identity,multiply(inverse(sF4_fnc),identity))),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f831,f151])).
% 69.07/15.58  fof(f3258,plain,(
% 69.07/15.58    identity=least_upper_bound(identity,multiply(inverse(sF4_fnc),identity))),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f21,f3196])).
% 69.07/15.58  fof(f3259,plain,(
% 69.07/15.58    identity=least_upper_bound(identity,inverse(sF4_fnc))),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f343,f3258])).
% 69.07/15.58  fof(f3327,plain,(
% 69.07/15.58    multiply(a,sF5_fnc)=least_upper_bound(sF2_fnc,multiply(a,identity))),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f42,f156])).
% 69.07/15.58  fof(f3351,plain,(
% 69.07/15.58    multiply(a,sF5_fnc)=least_upper_bound(sF2_fnc,a)),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f343,f3327])).
% 69.07/15.58  fof(f3579,plain,(
% 69.07/15.58    least_upper_bound(b,identity)=least_upper_bound(sF5_fnc,inverse(sF4_fnc))),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f3259,f89])).
% 69.07/15.58  fof(f3596,plain,(
% 69.07/15.58    sF5_fnc=least_upper_bound(sF5_fnc,inverse(sF4_fnc))),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f42,f3579])).
% 69.07/15.58  fof(f3694,plain,(
% 69.07/15.58    multiply(sF4_fnc,sF5_fnc)=least_upper_bound(sF3_fnc,multiply(sF4_fnc,inverse(sF4_fnc)))),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f3596,f152])).
% 69.07/15.58  fof(f3709,plain,(
% 69.07/15.58    sF3_fnc=least_upper_bound(sF3_fnc,multiply(sF4_fnc,inverse(sF4_fnc)))),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f43,f3694])).
% 69.07/15.58  fof(f3710,plain,(
% 69.07/15.58    sF3_fnc=least_upper_bound(sF3_fnc,identity)),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f61,f3709])).
% 69.07/15.58  fof(f3717,plain,(
% 69.07/15.58    sF3_fnc=least_upper_bound(identity,sF3_fnc)),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f24,f3710])).
% 69.07/15.58  fof(f4013,plain,(
% 69.07/15.58    least_upper_bound(sF2_fnc,sF3_fnc)=least_upper_bound(sF1_fnc,sF3_fnc)),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f3717,f91])).
% 69.07/15.58  fof(f4014,plain,(
% 69.07/15.58    least_upper_bound(a,sF3_fnc)=least_upper_bound(sF4_fnc,sF3_fnc)),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f3717,f90])).
% 69.07/15.58  fof(f4030,plain,(
% 69.07/15.58    least_upper_bound(a,sF3_fnc)=sF3_fnc),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f2437,f4014])).
% 69.07/15.58  fof(f4049,plain,(
% 69.07/15.58    ![X0]: (least_upper_bound(X0,sF3_fnc)=least_upper_bound(sF3_fnc,least_upper_bound(X0,a)))),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f4030,f85])).
% 69.07/15.58  fof(f4630,plain,(
% 69.07/15.58    multiply(sF4_fnc,sF5_fnc)=least_upper_bound(sF3_fnc,multiply(a,sF5_fnc))),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f312,f236])).
% 69.07/15.58  fof(f4665,plain,(
% 69.07/15.58    sF3_fnc=least_upper_bound(sF3_fnc,multiply(a,sF5_fnc))),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f43,f4630])).
% 69.07/15.58  fof(f4666,plain,(
% 69.07/15.58    sF3_fnc=least_upper_bound(sF3_fnc,least_upper_bound(sF2_fnc,a))),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f3351,f4665])).
% 69.07/15.58  fof(f4667,plain,(
% 69.07/15.58    sF3_fnc=least_upper_bound(sF1_fnc,sF3_fnc)),
% 69.07/15.58    inference(backward_demodulation,[status(thm)],[f4668,f4013])).
% 69.07/15.58  fof(f4668,plain,(
% 69.07/15.58    sF3_fnc=least_upper_bound(sF2_fnc,sF3_fnc)),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f4049,f4666])).
% 69.07/15.58  fof(f4727,plain,(
% 69.07/15.58    sF1_fnc=greatest_lower_bound(sF3_fnc,sF1_fnc)),
% 69.07/15.58    inference(paramodulation,[status(thm)],[f4667,f1317])).
% 69.07/15.58  fof(f4740,plain,(
% 69.07/15.58    sF1_fnc=sF0_fnc),
% 69.07/15.58    inference(forward_demodulation,[status(thm)],[f1302,f4727])).
% 69.07/15.58  fof(f4741,plain,(
% 69.07/15.58    $false),
% 69.07/15.58    inference(forward_subsumption_resolution,[status(thm)],[f4740,f48])).
% 69.07/15.58  % SZS output end CNFRefutation for theBenchmark.p
% 60.97/16.06  % Elapsed time: 15.377186 seconds
% 60.97/16.06  % CPU time: 61.481656 seconds
% 60.97/16.06  % Total memory used: 6.867 GB
% 60.97/16.06  % Net memory used: 6.862 GB
%------------------------------------------------------------------------------