↑ 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-2 : 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 : n007.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 50.46s 13.43s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP185-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n007.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 20:03:22 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 50.46/13.43  % Refutation found
% 50.46/13.43  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 50.46/13.43  % SZS output start CNFRefutation for theBenchmark
% 50.46/13.43  fof(f1,axiom,(
% 50.46/13.43    (![X]: (multiply(identity,X) = X ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f2,axiom,(
% 50.46/13.43    (![X]: (multiply(inverse(X),X) = identity ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f3,axiom,(
% 50.46/13.43    (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f5,axiom,(
% 50.46/13.43    (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f7,axiom,(
% 50.46/13.43    (![X,Y,Z]: (least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f8,axiom,(
% 50.46/13.43    (![X]: (least_upper_bound(X,X) = X ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f12,axiom,(
% 50.46/13.43    (![X,Y,Z]: (multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f14,axiom,(
% 50.46/13.43    (![Y,Z,X]: (multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f17,hypothesis,(
% 50.46/13.43    (![X]: (inverse(inverse(X)) = X ))),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f19,negated_conjecture,(
% 50.46/13.43    least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)) ),
% 50.46/13.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 50.46/13.43  fof(f20,plain,(
% 50.46/13.43    ![X0]: (multiply(identity,X0)=X0)),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f1])).
% 50.46/13.43  fof(f21,plain,(
% 50.46/13.43    ![X0]: (multiply(inverse(X0),X0)=identity)),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f2])).
% 50.46/13.43  fof(f22,plain,(
% 50.46/13.43    ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f3])).
% 50.46/13.43  fof(f24,plain,(
% 50.46/13.43    ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f5])).
% 50.46/13.43  fof(f26,plain,(
% 50.46/13.43    ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(least_upper_bound(X0,X1),X2))),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f7])).
% 50.46/13.43  fof(f27,plain,(
% 50.46/13.43    ![X0]: (least_upper_bound(X0,X0)=X0)),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f8])).
% 50.46/13.43  fof(f31,plain,(
% 50.46/13.43    ![X0,X1,X2]: (multiply(X0,least_upper_bound(X1,X2))=least_upper_bound(multiply(X0,X1),multiply(X0,X2)))),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f12])).
% 50.46/13.43  fof(f33,plain,(
% 50.46/13.43    ![X0,X1,X2]: (multiply(least_upper_bound(X0,X1),X2)=least_upper_bound(multiply(X0,X2),multiply(X1,X2)))),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f14])).
% 50.46/13.43  fof(f36,plain,(
% 50.46/13.43    ![X0]: (inverse(inverse(X0))=X0)),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f17])).
% 50.46/13.43  fof(f38,plain,(
% 50.46/13.43    ~least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)))=multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))),
% 50.46/13.43    inference(cnf_transformation,[status(thm)],[f19])).
% 50.46/13.43  fof(f39,definition,(
% 50.46/13.43    sF2_fnc=multiply(a,b)),
% 50.46/13.43    introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition])).
% 50.46/13.43  fof(f40,definition,(
% 50.46/13.43    sF1_fnc=least_upper_bound(sF2_fnc,identity)),
% 50.46/13.43    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 50.46/13.43  fof(f41,definition,(
% 50.46/13.43    sF4_fnc=least_upper_bound(a,identity)),
% 50.46/13.43    introduced(definition,[new_symbols(definition,[sF4_fnc])],[function_definition])).
% 50.46/13.43  fof(f42,definition,(
% 50.46/13.43    sF5_fnc=least_upper_bound(b,identity)),
% 50.46/13.43    introduced(definition,[new_symbols(definition,[sF5_fnc])],[function_definition])).
% 50.46/13.43  fof(f43,definition,(
% 50.46/13.43    sF3_fnc=multiply(sF4_fnc,sF5_fnc)),
% 50.46/13.43    introduced(definition,[new_symbols(definition,[sF3_fnc])],[function_definition])).
% 50.46/13.43  fof(f44,definition,(
% 50.46/13.43    sF0_fnc=least_upper_bound(sF1_fnc,sF3_fnc)),
% 50.46/13.43    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 50.46/13.43  fof(f45,definition,(
% 50.46/13.43    sF6_fnc=multiply(sF4_fnc,sF5_fnc)),
% 50.46/13.43    introduced(definition,[new_symbols(definition,[sF6_fnc])],[function_definition])).
% 50.46/13.43  fof(f46,plain,(
% 50.46/13.43    ~sF0_fnc=sF6_fnc),
% 50.46/13.43    inference(definition_folding,[],[f38,f45,f44,f43,f42,f41,f40,f39])).
% 50.46/13.43  fof(f47,plain,(
% 50.46/13.43    sF6_fnc=sF3_fnc),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f43,f45])).
% 50.46/13.43  fof(f48,plain,(
% 50.46/13.43    ~sF0_fnc=sF3_fnc),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f47,f46])).
% 50.46/13.43  fof(f57,plain,(
% 50.46/13.43    ![X0]: (least_upper_bound(sF1_fnc,least_upper_bound(sF3_fnc,X0))=least_upper_bound(sF0_fnc,X0))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f44,f26])).
% 50.46/13.43  fof(f58,plain,(
% 50.46/13.43    ![X0]: (least_upper_bound(b,least_upper_bound(identity,X0))=least_upper_bound(sF5_fnc,X0))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f42,f26])).
% 50.46/13.43  fof(f60,plain,(
% 50.46/13.43    ![X0]: (least_upper_bound(sF2_fnc,least_upper_bound(identity,X0))=least_upper_bound(sF1_fnc,X0))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f40,f26])).
% 50.46/13.43  fof(f61,plain,(
% 50.46/13.43    ![X0,X1]: (least_upper_bound(X0,least_upper_bound(X0,X1))=least_upper_bound(X0,X1))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f27,f26])).
% 50.46/13.43  fof(f68,plain,(
% 50.46/13.43    least_upper_bound(b,sF5_fnc)=least_upper_bound(b,identity)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f42,f61])).
% 50.46/13.43  fof(f80,plain,(
% 50.46/13.43    least_upper_bound(b,sF5_fnc)=sF5_fnc),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f42,f68])).
% 50.46/13.43  fof(f98,plain,(
% 50.46/13.43    ![X0]: (multiply(sF4_fnc,least_upper_bound(sF5_fnc,X0))=least_upper_bound(sF3_fnc,multiply(sF4_fnc,X0)))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f43,f31])).
% 50.46/13.43  fof(f178,plain,(
% 50.46/13.43    sF5_fnc=least_upper_bound(identity,b)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f42,f24])).
% 50.46/13.43  fof(f179,plain,(
% 50.46/13.43    sF4_fnc=least_upper_bound(identity,a)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f41,f24])).
% 50.46/13.43  fof(f221,plain,(
% 50.46/13.43    ![X0,X1]: (multiply(least_upper_bound(identity,X0),X1)=least_upper_bound(X1,multiply(X0,X1)))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f20,f33])).
% 50.46/13.43  fof(f225,plain,(
% 50.46/13.43    ![X0,X1]: (multiply(least_upper_bound(X0,identity),X1)=least_upper_bound(multiply(X0,X1),X1))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f20,f33])).
% 50.46/13.43  fof(f247,plain,(
% 50.46/13.43    least_upper_bound(identity,sF5_fnc)=least_upper_bound(identity,b)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f178,f61])).
% 50.46/13.43  fof(f249,plain,(
% 50.46/13.43    least_upper_bound(identity,sF5_fnc)=sF5_fnc),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f178,f247])).
% 50.46/13.43  fof(f250,plain,(
% 50.46/13.43    least_upper_bound(identity,sF4_fnc)=least_upper_bound(identity,a)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f179,f61])).
% 50.46/13.43  fof(f252,plain,(
% 50.46/13.43    least_upper_bound(identity,sF4_fnc)=sF4_fnc),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f179,f250])).
% 50.46/13.43  fof(f287,plain,(
% 50.46/13.43    multiply(least_upper_bound(identity,sF4_fnc),sF5_fnc)=least_upper_bound(sF5_fnc,sF3_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f43,f221])).
% 50.46/13.43  fof(f288,plain,(
% 50.46/13.43    multiply(least_upper_bound(identity,a),b)=least_upper_bound(b,sF2_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f39,f221])).
% 50.46/13.43  fof(f296,plain,(
% 50.46/13.43    multiply(sF4_fnc,sF5_fnc)=least_upper_bound(sF5_fnc,sF3_fnc)),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f252,f287])).
% 50.46/13.43  fof(f297,plain,(
% 50.46/13.43    sF3_fnc=least_upper_bound(sF5_fnc,sF3_fnc)),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f43,f296])).
% 50.46/13.43  fof(f298,plain,(
% 50.46/13.43    multiply(sF4_fnc,b)=least_upper_bound(b,sF2_fnc)),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f179,f288])).
% 50.46/13.43  fof(f302,plain,(
% 50.46/13.43    sF3_fnc=least_upper_bound(sF3_fnc,sF5_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f24,f297])).
% 50.46/13.43  fof(f312,plain,(
% 50.46/13.43    ![X0]: (least_upper_bound(b,least_upper_bound(sF2_fnc,X0))=least_upper_bound(multiply(sF4_fnc,b),X0))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f298,f26])).
% 50.46/13.43  fof(f322,plain,(
% 50.46/13.43    ![X0,X1]: (multiply(identity,X0)=multiply(inverse(X1),multiply(X1,X0)))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f21,f22])).
% 50.46/13.43  fof(f324,plain,(
% 50.46/13.43    ![X0,X1]: (X0=multiply(inverse(X1),multiply(X1,X0)))),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f20,f322])).
% 50.46/13.43  fof(f382,plain,(
% 50.46/13.43    ![X0]: (least_upper_bound(b,least_upper_bound(sF2_fnc,X0))=least_upper_bound(X0,multiply(sF4_fnc,b)))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f24,f312])).
% 50.46/13.43  fof(f496,plain,(
% 50.46/13.43    ![X0]: (X0=multiply(inverse(inverse(X0)),identity))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f21,f324])).
% 50.46/13.43  fof(f500,plain,(
% 50.46/13.43    sF5_fnc=multiply(inverse(sF4_fnc),sF3_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f43,f324])).
% 50.46/13.43  fof(f509,plain,(
% 50.46/13.43    ![X0]: (X0=multiply(X0,identity))),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f36,f496])).
% 50.46/13.43  fof(f525,plain,(
% 50.46/13.43    ![X0,X1]: (multiply(X0,least_upper_bound(X1,identity))=least_upper_bound(multiply(X0,X1),X0))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f509,f31])).
% 50.46/13.43  fof(f526,plain,(
% 50.46/13.43    ![X0,X1]: (multiply(X0,least_upper_bound(identity,X1))=least_upper_bound(X0,multiply(X0,X1)))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f509,f31])).
% 50.46/13.43  fof(f565,plain,(
% 50.46/13.43    multiply(least_upper_bound(sF4_fnc,identity),sF5_fnc)=least_upper_bound(sF3_fnc,sF5_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f43,f225])).
% 50.46/13.43  fof(f592,plain,(
% 50.46/13.43    multiply(least_upper_bound(sF4_fnc,identity),sF5_fnc)=sF3_fnc),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f302,f565])).
% 50.46/13.43  fof(f641,plain,(
% 50.46/13.43    multiply(least_upper_bound(sF4_fnc,identity),least_upper_bound(sF5_fnc,identity))=least_upper_bound(sF3_fnc,least_upper_bound(sF4_fnc,identity))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f592,f525])).
% 50.46/13.43  fof(f647,plain,(
% 50.46/13.43    multiply(sF4_fnc,least_upper_bound(sF5_fnc,identity))=least_upper_bound(sF3_fnc,sF4_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f43,f525])).
% 50.46/13.43  fof(f722,plain,(
% 50.46/13.43    multiply(sF4_fnc,least_upper_bound(identity,sF5_fnc))=least_upper_bound(sF4_fnc,sF3_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f43,f526])).
% 50.46/13.43  fof(f750,plain,(
% 50.46/13.43    multiply(sF4_fnc,sF5_fnc)=least_upper_bound(sF4_fnc,sF3_fnc)),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f249,f722])).
% 50.46/13.43  fof(f751,plain,(
% 50.46/13.43    sF3_fnc=least_upper_bound(sF4_fnc,sF3_fnc)),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f43,f750])).
% 50.46/13.43  fof(f792,plain,(
% 50.46/13.43    least_upper_bound(sF1_fnc,sF3_fnc)=least_upper_bound(sF0_fnc,sF5_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f302,f57])).
% 50.46/13.43  fof(f805,plain,(
% 50.46/13.43    sF0_fnc=least_upper_bound(sF0_fnc,sF5_fnc)),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f44,f792])).
% 50.46/13.43  fof(f813,plain,(
% 50.46/13.43    sF3_fnc=least_upper_bound(sF3_fnc,sF4_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f24,f751])).
% 50.46/13.43  fof(f820,plain,(
% 50.46/13.43    multiply(sF4_fnc,least_upper_bound(sF5_fnc,identity))=sF3_fnc),
% 50.46/13.43    inference(backward_demodulation,[status(thm)],[f813,f647])).
% 50.46/13.43  fof(f832,plain,(
% 50.46/13.43    ![X0]: (least_upper_bound(sF3_fnc,least_upper_bound(sF4_fnc,X0))=least_upper_bound(sF3_fnc,X0))),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f813,f26])).
% 50.46/13.43  fof(f835,plain,(
% 50.46/13.43    multiply(least_upper_bound(sF4_fnc,identity),least_upper_bound(sF5_fnc,identity))=least_upper_bound(sF3_fnc,identity)),
% 50.46/13.43    inference(backward_demodulation,[status(thm)],[f832,f641])).
% 50.46/13.43  fof(f898,plain,(
% 50.46/13.43    least_upper_bound(sF5_fnc,identity)=multiply(inverse(sF4_fnc),sF3_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f820,f324])).
% 50.46/13.43  fof(f914,plain,(
% 50.46/13.43    multiply(least_upper_bound(sF4_fnc,identity),sF5_fnc)=least_upper_bound(sF3_fnc,identity)),
% 50.46/13.43    inference(backward_demodulation,[status(thm)],[f916,f835])).
% 50.46/13.43  fof(f916,plain,(
% 50.46/13.43    least_upper_bound(sF5_fnc,identity)=sF5_fnc),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f500,f898])).
% 50.46/13.43  fof(f928,plain,(
% 50.46/13.43    sF3_fnc=least_upper_bound(sF3_fnc,identity)),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f592,f914])).
% 50.46/13.43  fof(f939,plain,(
% 50.46/13.43    sF3_fnc=least_upper_bound(identity,sF3_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f24,f928])).
% 50.46/13.43  fof(f941,plain,(
% 50.46/13.43    least_upper_bound(sF1_fnc,sF3_fnc)=least_upper_bound(sF0_fnc,identity)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f928,f57])).
% 50.46/13.43  fof(f948,plain,(
% 50.46/13.43    sF0_fnc=least_upper_bound(sF0_fnc,identity)),
% 50.46/13.43    inference(forward_demodulation,[status(thm)],[f44,f941])).
% 50.46/13.43  fof(f954,plain,(
% 50.46/13.43    sF0_fnc=least_upper_bound(identity,sF0_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f24,f948])).
% 50.46/13.43  fof(f1508,plain,(
% 50.46/13.43    least_upper_bound(b,sF0_fnc)=least_upper_bound(sF5_fnc,sF0_fnc)),
% 50.46/13.43    inference(paramodulation,[status(thm)],[f954,f58])).
% 50.46/13.43  fof(f1516,plain,(
% 50.46/13.44    least_upper_bound(b,sF5_fnc)=least_upper_bound(sF5_fnc,b)),
% 50.46/13.44    inference(paramodulation,[status(thm)],[f178,f58])).
% 50.46/13.44  fof(f1532,plain,(
% 50.46/13.44    sF5_fnc=least_upper_bound(sF5_fnc,b)),
% 50.46/13.44    inference(forward_demodulation,[status(thm)],[f80,f1516])).
% 50.46/13.44  fof(f1555,plain,(
% 50.46/13.44    least_upper_bound(b,sF0_fnc)=least_upper_bound(sF0_fnc,sF5_fnc)),
% 50.46/13.44    inference(paramodulation,[status(thm)],[f24,f1508])).
% 50.46/13.44  fof(f1564,plain,(
% 50.46/13.44    least_upper_bound(b,sF0_fnc)=sF0_fnc),
% 50.46/13.44    inference(forward_demodulation,[status(thm)],[f805,f1555])).
% 50.46/13.44  fof(f1732,plain,(
% 50.46/13.44    least_upper_bound(sF2_fnc,sF3_fnc)=least_upper_bound(sF1_fnc,sF3_fnc)),
% 50.46/13.44    inference(paramodulation,[status(thm)],[f939,f60])).
% 50.46/13.44  fof(f1754,plain,(
% 50.46/13.44    least_upper_bound(sF2_fnc,sF3_fnc)=sF0_fnc),
% 50.46/13.44    inference(forward_demodulation,[status(thm)],[f44,f1732])).
% 50.46/13.44  fof(f2060,plain,(
% 50.46/13.44    multiply(sF4_fnc,least_upper_bound(sF5_fnc,b))=least_upper_bound(b,least_upper_bound(sF2_fnc,sF3_fnc))),
% 50.46/13.44    inference(paramodulation,[status(thm)],[f382,f98])).
% 50.46/13.44  fof(f2075,plain,(
% 50.46/13.44    multiply(sF4_fnc,sF5_fnc)=least_upper_bound(b,least_upper_bound(sF2_fnc,sF3_fnc))),
% 50.46/13.44    inference(forward_demodulation,[status(thm)],[f1532,f2060])).
% 50.46/13.44  fof(f2076,plain,(
% 50.46/13.44    sF3_fnc=least_upper_bound(b,least_upper_bound(sF2_fnc,sF3_fnc))),
% 50.46/13.44    inference(forward_demodulation,[status(thm)],[f43,f2075])).
% 50.46/13.44  fof(f2077,plain,(
% 50.46/13.44    sF3_fnc=least_upper_bound(b,sF0_fnc)),
% 50.46/13.44    inference(forward_demodulation,[status(thm)],[f1754,f2076])).
% 50.46/13.44  fof(f2078,plain,(
% 50.46/13.44    sF3_fnc=sF0_fnc),
% 50.46/13.44    inference(forward_demodulation,[status(thm)],[f1564,f2077])).
% 50.46/13.44  fof(f2079,plain,(
% 50.46/13.44    $false),
% 50.46/13.44    inference(forward_subsumption_resolution,[status(thm)],[f2078,f48])).
% 50.46/13.44  % SZS output end CNFRefutation for theBenchmark.p
% 15.42/16.66  % Elapsed time: 16.290042 seconds
% 15.42/16.66  % CPU time: 127.774692 seconds
% 15.42/16.66  % Total memory used: 55.330 GB
% 15.42/16.66  % Net memory used: 55.325 GB
%------------------------------------------------------------------------------